12 search results - page 2 / 3 » A Theory of Singly-Linked Lists and its Extensible Decision ... |
LICS
2008
IEEE
13 years 11 months ago
2008
IEEE
LF is a dependent type theory in which many other formal systems can be conveniently embedded. However, correct use of LF relies on nontrivial metatheoretic developments such as p...
ASIAN
2009
Springer
13 years 6 months ago
2009
Springer
In cryptographic protocols, zero knowledge proofs are employed for a principal A to communicate some non-trivial information t to B while at the same time ensuring that B cannot de...
LPAR
2010
Springer
13 years 2 months ago
2010
Springer
We consider a mild extension of universal algebra in which terms are built both from deterministic and probabilistic variables, and are interpreted as distributions. We formulate a...
NMR
2004
Springer
13 years 10 months ago
2004
Springer
The development of Logic Programming and Defeasible Argumentation lead to Defeasible Logic Programming. Its core resides in the characterization of the warrant procedure. Defeasib...
ESOP
2000
Springer
13 years 8 months ago
2000
Springer
We exhibit a technique for automatically verifying the safety of simple C programs working on tree-shaped data structures. We do not consider the complete behavior of programs, but...