797 search results - page 87 / 160 » Eliminating Proofs from Programs |
117
Voted
VLDB
1990
ACM
15 years 4 months ago
1990
ACM
Database programming requires having the knowledge of database semantics both to maintain database integrity and to explore more optimization opportunities. Automated programming ...
JLP
2011
14 years 3 months ago
2011
A Concurrent Kleene Algebra offers two composition operators, related by a weak version of an exchange law: when applied in a trace model of program semantics, one of them stands...
100
Voted
COCOON
2008
Springer
15 years 2 months ago
2008
Springer
When a switching network topology is used for constructing optical cross-connects, as in the circuit switching case, no two routes are allowed to share a link. However, if two rou...
93
Voted
IWPC
2009
IEEE
15 years 7 months ago
2009
IEEE
A common static software bug detection technique is to use path simulation. Each execution path is simulated using symbolic variables to determine if any software errors could occ...
126
Voted
PPDP
2005
Springer
15 years 6 months ago
2005
Springer
When addressing the formal validation of generated software, two main alternatives consist either to prove the correctness of compilers or to directly validate the generated code....