1143 search results - page 154 / 229 » Abstract Syntax and Logic Programming |
133
Voted
ISSTA
2010
ACM
15 years 4 months ago
2010
ACM
This paper presents a new technique, called Symbolic Program Decomposition (or SPD), for symbolic execution of multiple paths that is more scalable than existing techniques, which...
89
Voted
CORR
2007
Springer
15 years 2 months ago
2007
Springer
nalysis of logic programs, abstract domains for detecting sharing and linearity ion are widely used. Devising abstract unification algorithms for such domains has proved to be ra...
123
Voted
ICLP
2003
Springer
15 years 7 months ago
2003
Springer
Abstract The ntcc process calculus is a timed concurrent constraint programming (ccp) model equipped with a first-order linear-temporal logic (LTL) for expressing process specifi...
135
Voted
CSL
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. Probably the most significant result concerning cut-free sequent calculus proofs in linear logic is the completeness of focused proofs. This completeness theorem has a n...
POPL
2012
ACM
13 years 10 months ago
2012
ACM
We develop logical mechanisms and decision procedures to facilitate the verification of full functional properties of inductive tree data-structures using recursion that are soun...