Completeness Theorems and ?-Calculus -- Completeness Theorems and ?-Calculus -- A Tutorial Example of the Semantic Approach to Foundational Proof-Carrying Code: Abstract -- Can Proofs Be Animated By Games? -- Contributed Papers -- Untyped Algorithmic Equality for Martin-Löf’s Logical Framework with Surjective Pairs -- The Monadic Second Order Theory of Trees Given by Arbitrary Level-Two Recu…
Symbolic Equivalences for Open Systems -- Specifying and Verifying UML Activity Diagrams Via Graph Transformation -- Mobile UML Statecharts with Localities -- Communities: Concept-Based Querying for Mobile Services -- Towards a Formal Treatment of Secrecy Against Computational Adversaries -- For-LySa: UML for Authentication Analysis -- Performance Analysis of a UML Micro-business Case Study -- …
Dynamic Languages -- On the Revival of Dynamic Languages -- Component Composition -- Composition-Oriented Service Discovery -- Ad Hoc Composition of User Tasks in Pervasive Computing Environments -- Improving Composition Support with Lightweight Metadata-Based Extensions of Component Models -- Directory Support for Large-Scale, Automated Service Composition -- Component Controls and Protocols -…
Exploiting Single-Assignment Properties to Optimize Message-Passing Programs by Code Transformations -- The Feasibility of Interactively Probing Quiescent Properties of GUI Applications -- A Functional Programming Technique for Forms in Graphical User Interfaces -- A Rational Deconstruction of Landin’s SECD Machine -- Explaining ML Type Errors by Data Flows -- V?M: A Virtual Machine for Stric…
Invited Talks -- Algorithmic Game Semantics and Static Analysis -- From Typed Process Calculi to Source-Based Security -- Contributed Papers -- Widening Operators for Weakly-Relational Numeric Abstractions -- Generation of Basic Semi-algebraic Invariants Using Convex Polyhedra -- Inference of Well-Typings for Logic Programs with Application to Termination Analysis -- Memory Space Conscious Loop…
Invited Talks -- Object-Oriented Reengineering Patterns — An Overview -- abc: The AspectBench Compiler for AspectJ -- Certifiable Program Generation -- Domain-Specific Language -- A Generative Programming Approach to Developing DSL Compilers -- Efficient Code Generation for a Domain Specific Language -- On Domain-Specific Languages Reengineering -- Bossa Nova: Introducing Modularity into the …
Research Papers -- An Output-Polynomial Time Algorithm for Mining Frequent Closed Attribute Trees -- Guiding Inference Through Relational Reinforcement Learning -- Converting Semantic Meta-knowledge into Inductive Bias -- Learning Teleoreactive Logic Programs from Problem Solving -- A Framework for Set-Oriented Computation in Inductive Logic Programming and Its Application in Generalizing Inver…
Preliminaries -- Concepts of the CORBA Standard -- to the Interface Definition Language -- IDL to Java Mapping -- Important Elements of the ORB Runtime -- A First Example -- Generating Remote Objects -- Alternatives for Designing IDL Interfaces -- Inheritance and Polymorphism -- Implementing Distributed Callbacks -- Utilizing Value Types -- Utilizing Interfaces of the DynamicAny Module -- Dynam…
to Application Logging -- Understanding Apache log4j -- Destination of Logging—The Appender Objects -- Formatting Logging Information in log4j -- Filtering, Error Handling, and Special Rendering of Log Messages -- Extending log4j to Create Custom Logging Components -- A Complete log4j Example -- log4j and J2EE -- Using the Apache Log Tag Library -- Best Practices and Looking Forward to 1.3.In…
Genetic Programming: Theory and Practice -- Discovering Financial Technical Trading Rules Using Genetic Programming with Lambda Abstraction -- Using Genetic Programming in Industrial Statistical Model Building -- Population Sizing for Genetic Programming Based on Decision-Making -- Considering the Roles of Structure in Problem Solving by Computer -- Lessons Learned Using Genetic Programming in …