555 search results - page 44 / 111 » Complexity of Operations on Cofinite Languages |
POPL
1989
ACM
13 years 11 months ago
1989
ACM
raction that a programming language provides influences the structure and algorithmic complexity of the resulting programs: just imagine creating an artificial intelligence engine ...
JOT
2008
13 years 7 months ago
2008
Complex software systems possess concurrent and reactive behaviors requiring precise specifications prior to development. Lamport's transition axiom method is a formal specif...
ICLP
2009
Springer
14 years 8 months ago
2009
Springer
The SLG-WAM of XSB Prolog soundly implements the Well-Founded Semantics (WFS) for logic programs, but in a few pathological cases its engine treats atoms as undefined that are true...
PPDP
2009
Springer
14 years 2 months ago
2009
Springer
This paper describes the encoding of a telecommunications feature subscription configuration problem to propositional logic and its solution using a state-of-the-art Boolean sati...
ESOP
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. We show how to formalise a constraint-based data flow analysis in the specification language of the Coq proof assistant. This involves defining a dependent type of lat...