3693 search results - page 452 / 739 » Splitting a Logic Program |
125
Voted
TOPLAS
2002
15 years 3 months ago
2002
traction and information hiding K. RUSTAN M. LEINO and GREG NELSON Compaq Systems Research Center er describes an approach for verifying programs in the presence of data abstractio...
122
click to vote
SIGSOFT
2007
ACM
16 years 4 months ago
2007
ACM
Asynchronous systems components are hard to write, hard to reason about, and (not coincidentally) hard to mechanically verify. In order to achieve high performance, asynchronous c...
139
click to vote
KBSE
2007
IEEE
15 years 10 months ago
2007
IEEE
Achieving high structural coverage such as branch coverage in objectoriented programs is an important and yet challenging goal due to two main challenges. First, some branches inv...
120
Voted
LPNMR
2007
Springer
15 years 9 months ago
2007
Springer
Logic programming under the answer-set semantics nowadays deals with numerous different notions of equivalence between programs. This is due to the fact that equivalence for substi...
137
Voted
WSC
2000
15 years 5 months ago
2000
Analytical models for the dynamics of some discrete event systems are introduced where the system trajectories are solutions to linear and mixed-integer programs. 1 BACKGROUND The...