632 search results - page 45 / 127 » Combining programming with theorem proving |
117
Voted
TACAS
2009
Springer
15 years 8 months ago
2009
Springer
We introduce the All-Termination(T) problem: given a termination solver, T, and a program (a set of functions), find every set of formal arguments whose consideration is sufficie...
117
Voted
FOSSACS
2009
Springer
15 years 8 months ago
2009
Springer
Abstract. We define and study an automata model of concurrent recursive programs. An automaton consists of a finite number of pushdown systems running in parallel and communicati...
123
click to vote
ACL
1997
15 years 3 months ago
1997
Recent work has seen the emergence of a common framework for parsing categorial grammar (CG) formalisms that fall within the 'type-logical' tradition (such as the Lambek...
109
Voted
CHARME
2003
Springer
15 years 7 months ago
2003
Springer
Intrusion-tolerance is the technique of using fault-tolerance to achieve security properties. Assuming that faults, both benign and Byzantine, are unavoidable, the main goal of Int...
128
Voted
FMCAD
2004
Springer
15 years 7 months ago
2004
Springer
Abstract. We relate two well-studied methodologies in deductive verification of operationally modeled sequential programs, namely the use of inductive invariants and clock functio...