249 search results - page 43 / 50 » Principals in Programming Languages: A Syntactic Proof Techn... |
GPCE
2007
Springer
14 years 1 months ago
2007
Springer
Most software applications use a relational database for data management and storage. Interaction with such a database is often done by letting the program construct strings with ...
CP
2009
Springer
14 years 8 months ago
2009
Springer
In this work, we improve on existing work that studied the relationship between the proof system of modern SAT solvers and general resolution. Previous contributions such as those ...
FASE
2010
Springer
14 years 2 months ago
2010
Springer
Abstract. Abstraction is essential in the formal specification of programs. A common way of writing abstract specifications is to specify implementations in terms of basic mathem...
IFIP
2004
Springer
14 years 25 days ago
2004
Springer
A term terminates if all its reduction sequences are of finite length. We show four type systems that ensure termination of well-typed π-calculus processes. The systems are obtai...
ENTCS
2007
13 years 7 months ago
2007
Context-sensitive rewriting (CSR) is a restriction of rewriting which forbids reductions on selected arguments of functions. Proving termination of CSR is an interesting problem w...