4693 search results - page 916 / 939 » Verifying Hybrid Systems |
209
Voted
POPL
2006
ACM
16 years 23 days ago
2006
ACM
The TCP/IP protocols and Sockets API underlie much of modern computation, but their semantics have historically been very complex and ill-defined. The real standard is the de fact...
208
Voted
POPL
2005
ACM
16 years 23 days ago
2005
ACM
on Predicate Abstraction and Fair Termination Andreas Podelski Andrey Rybalchenko Max-Planck-Institut f?ur Informatik Saarbr?ucken, Germany Predicate abstraction is the basis of m...
111
click to vote
CADE
2005
Springer
16 years 22 days 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...
190
click to vote
VLDB
2007
ACM
16 years 20 days ago
2007
ACM
This paper introduces a class of conditional inclusion dependencies (CINDs), which extends traditional inclusion dependencies (INDs) by enforcing bindings of semantically related ...
192
click to vote
SIGMOD
2007
ACM
16 years 18 days ago
2007
ACM
Graphs are prevalently used to model the relationships between objects in various domains. With the increasing usage of graph databases, it has become more and more demanding to e...