Sciweavers

3319 search results - page 71 / 664
» Subshifts, Languages and Logic
Sort
View
128
Voted
ACL2
2006
ACM
15 years 4 months ago
Quantification in tail-recursive function definitions
We investigate the logical issues behind axiomatizing equations that contain both recursive calls and quantifiers in ACL2. We identify a class of such equations, named extended ta...
Sandip Ray
IANDC
2007
132views more  IANDC 2007»
15 years 14 days ago
An automata-theoretic approach to constraint LTL
We consider an extension of linear-time temporal logic (LTL) with constraints interpreted over a concrete domain. We use a new automata-theoretic technique to show pspace decidabi...
Stéphane Demri, Deepak D'Souza
120
Voted
CADE
1998
Springer
15 years 4 months ago
Automated Theorem Proving in a Simple Meta-Logic for LF
Abstract. Higher-order representation techniques allow elegant encodings of logics and programming languages in the logical framework LF, but unfortunately they are fundamentally i...
Carsten Schürmann, Frank Pfenning
126
Voted
POPL
2012
ACM
13 years 8 months ago
Higher-order functional reactive programming in bounded space
Functional reactive programming (FRP) is an elegant and successful approach to programming reactive systems declaratively. The high levels of abstraction and expressivity that mak...
Neelakantan R. Krishnaswami, Nick Benton, Jan Hoff...
PADL
2005
Springer
15 years 6 months ago
Towards Provably Correct Code Generation via Horn Logical Continuation Semantics
Abstract. Provably correct compilation is an important aspect in development of high assurance software systems. In this paper we explore approaches to provably correct code genera...
Qian Wang, Gopal Gupta, Michael Leuschel