442 search results - page 46 / 89 » Proof Abstraction for Imperative Languages |
136
click to vote
CSL
2007
Springer
16 years 10 days ago
2007
Springer
Abstract. By introducing a parallel extension rule that is aware of independence of the introduced extension variables, a calculus for quantified propositional logic is obtained w...
151
click to vote
PLDI
2006
ACM
16 years 3 days ago
2006
ACM
Progressing beyond the productivity of present-day languages appears to require using domain-specific knowledge. Domain-specific languages and libraries (DSLs) proliferate, but ...
166
click to vote
ENTCS
2008
15 years 6 months ago
2008
Thanks to recent advances, modern proof assistants now enable verification of realistic sequential programs. However, regarding the concurrency paradigm, previous work essentially...
150
click to vote
WIA
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. We explore expression automata with respect to determinism, minimization and primeness. We define determinism of expression automata using prefix-freeness. This approac...
143
click to vote
DLT
2008
15 years 7 months ago
2008
Abstract. Since recognizable tree languages are closed under the rational operations, every regular tree expression denotes a recognizable tree language. We provide an alternative ...