Sciweavers

6274 search results - page 87 / 1255
» Proofs, Programs, Processes
Sort
View
CADE
2005
Springer
16 years 6 days ago
Tabling for Higher-Order Logic Programming
We describe the design and implementation of a higher-order tabled logic programming interpreter where some redundant and infinite computation is eliminated by memoizing sub-comput...
Brigitte Pientka
ESOP
2005
Springer
15 years 5 months ago
Towards a Type System for Analyzing JavaScript Programs
JavaScript is a popular language for client-side web scripting. It has a dubious reputation among programmers for two reasons. First, many JavaScript programs are written against a...
Peter Thiemann
TPHOL
2002
IEEE
15 years 4 months ago
Weakest Precondition for General Recursive Programs Formalized in Coq
Abstract. This paper describes a formalization of the weakest precondition, wp, for general recursive programs using the type-theoretical proof assistant Coq. The formalization is ...
Xingyuan Zhang, Malcolm Munro, Mark Harman, Lin Hu
AMAST
2008
Springer
15 years 1 months ago
Verification of Java Programs with Generics
Several proof systems allow the formal verification of Java programs, and a specification language was specifically designed for Java. However, none of these systems support generi...
Kurt Stenzel, Holger Grandy, Wolfgang Reif
CORR
2002
Springer
81views Education» more  CORR 2002»
14 years 11 months ago
Value withdrawal explanations: a theoretical tool for programming environments
Abstract. Constraint logic programming combines declarativity and efficiency thanks to constraint solvers implemented for specific domains. Value withdrawal explanations have been ...
Willy Lesaint