499 search results - page 77 / 100 » Logic Programming in a Fragment of Intuitionistic Linear Log... |
138
click to vote
RISE
2004
Springer
15 years 9 months ago
2004
Springer
In this paper, we develop a symbolic representation for timed concurrent constraint (tccp) programs, which can be used for defining a lightweight model–checking algorithm for re...
128
click to vote
SAS
2007
Springer
15 years 10 months ago
2007
Springer
Existing shape analysis algorithms infer descriptions of data structures at program points, starting from a given precondition. We describe an analysis that does not require any pr...
125
click to vote
KR
1994
Springer
15 years 8 months ago
1994
Springer
This paper analyzes a language for actions and the deontic modalities over actions -- i.e., the modalities permitted, forbidden and obligatory. The work is based on: (1) an action...
141
click to vote
SIGSOFT
2003
ACM
15 years 9 months ago
2003
ACM
Model checking is an automated technique for verifying that a system satisfies a set of required properties. Such properties are typically expressed as temporal logic formulas, in...
128
click to vote
FPGA
1997
ACM
15 years 8 months ago
1997
ACM
We present a general approach to the FPGA technology mapping problem that applies to any logic block composed of lookup tables LUTs and can yield optimal solutions. The connecti...