76 search results - page 6 / 16 » Using Datalog and Boolean Equation Systems for Program Analy... |
CADE
2005
Springer
15 years 10 months ago
2005
Springer
We describe an algorithm for deciding the first-order multisorted theory BAPA, which combines 1) Boolean algebras of sets of uninterpreted elements (BA) and 2) Presburger arithmeti...
87
Voted
RTSS
1998
IEEE
15 years 1 months ago
1998
IEEE
We propose a unifying method for analysis of scheduling problems in real-time systems. The method is based on ACSR-VP, a real-time process algebra with value-passing capabilities....
APAQS
2001
IEEE
15 years 1 months ago
2001
IEEE
Code-patterns are statically recurring structure specific to a programming language. It can be parallel to aid in designing software systems for solving particular problems. Contr...
190
click to vote
PADL
2009
Springer
15 years 10 months ago
2009
Springer
Declarative Networking has been recently promoted as a high-level programming paradigm to more conveniently describe and implement systems that run in a distributed fashion over a ...
ICALP
2007
Springer
15 years 3 months ago
2007
Springer
We present algebraic conditions on constraint languages Γ that ensure the hardness of the constraint satisfaction problem CSP(Γ) for complexity classes L, NL, P, NP and ModpL. Th...