APLAS 2007
28 papers
- A Novel Test Case Generation Method for Prolog Programs Based on Call Patterns Semantics
- A Probabilistic Applied Pi-Calculus
- A Systematic Approach to Probabilistic Pointer Analysis
- A Trace Based Bisimulation for the Spi Calculus: An Extended Abstract
- Adjunct Elimination in Context Logic for Trees
- An Efficient SSA-Based Algorithm for Complete Global Value Numbering
- CCS with Replication in the Chomsky Hierarchy: The Expressive Power of Divergence
- Call-by-Name and Call-by-Value in Normal Modal Logic
- Call-by-Value Is Dual to Call-by-Name, Extended
- Complete Lattices and Up-To Techniques
- Deriving Compilers and Virtual Machines for a Multi-level Language
- Finally Tagless, Partially Evaluated
- Local Reasoning for Storable Locks and Threads
- Mixed Inductive/Coinductive Types and Strong Normalization
- Monadic, Prompt Lazy Assertions in Haskell
- More Typed Assembly Languages for Confidentiality
- On a Tighter Integration of Functional and Logic Programming
- Persistent Oberon: A Programming Language with Integrated Persistence
- Polymorphic Delimited Continuations
- Positive Arithmetic Without Exchange Is a Subclassical Logic
- Scalable Simulation of Cellular Signaling Networks
- Static and Dynamic Analysis: Better Together
- The Nuggetizer: Abstracting Away Higher-Orderness for Program Verification
- The Semantics of "Semantic Patches" in Coccinelle: Program Transformation for the Working Programmer
- Timed, Distributed, Probabilistic, Typed Processes
- Translation Correctness for First-Order Object-Oriented Pattern Matching
- Type-Based Verification of Correspondence Assertions for Communication Protocols
- X10: Concurrent Programming for Modern Architectures