3481 search results - page 11 / 697 » Higher-Order Logic Programming as Constraint Logic Programmi... |
FSTTCS
2004
Springer
15 years 3 months ago
2004
Springer
We consider the problem of symbolic reachability analysis of higher-order context-free processes. These models are generalizations of the context-free processes (also called BPA pr...
73
Voted
PLDI
1995
ACM
15 years 1 months ago
1995
ACM
d Abstract) Alexander Aiken Manuel F¨ahndrich Raph Levieny Computer Science Division University of California, Berkeleyz Static memory managementreplaces runtime garbage collecti...
FASE
2001
Springer
15 years 2 months ago
2001
Springer
Abstract. This paper describes a specialised logic for proving specifications in the Java Modeling Language (JML). JML is an interface specification language for Java. It allows ...
CONSTRAINTS
1999
14 years 9 months ago
1999
TPHOL
2007
IEEE
15 years 3 months ago
2007
IEEE
Terminator is a static analysis tool developed by Microsoft Research for proving termination of Windows device drivers written in C. This proof pearl describes a formalization in h...