187 search results - page 36 / 38 » On Expressive and Model Checking Power of Propositional Prog... |
DIMACS
1996
13 years 9 months ago
1996
in Structure'95. 14] R. Fagin. Easier ways to win logical games. In Proc. DIMACS Workshop on Descriptive Complexity and Finite Models, AMS 1997. 15] R. Fagin, L. Stockmeyer, M...
FCCM
2000
IEEE
14 years 1 days ago
2000
IEEE
Simplifying the programming models is paramount to the success of reconfigurable computing. We apply the principles of object-oriented programming to the design of stream archite...
APLAS
2005
ACM
14 years 1 months ago
2005
ACM
act Interpretation Perspective on Linear vs. Branching Time Francesco Ranzato and Francesco Tapparo Dipartimento di Matematica Pura ed Applicata, Universit`a di Padova, Italy It is...
SIGSOFT
2000
ACM
14 years 3 hour ago
2000
ACM
Constraint-based languages can express in a concise way the complex logic of a new generation of interactive services for applications such as banking or stock trading, that must ...
PLDI
2009
ACM
14 years 2 months ago
2009
ACM
Decentralized information flow control (DIFC) is a promising model for writing programs with powerful, end-to-end security guarantees. Current DIFC systems that run on commodity ...