26 search results - page 4 / 6 » Matching Logic: An Alternative to Hoare Floyd Logic |
ICPR
2008
IEEE
14 years 1 months ago
2008
IEEE
The Boyer-Moore algorithm uses two pre-computed tables for searching a string: skip, which utilizes the occurrence heuristic of symbols in a pattern, and shift, which utilizes the...
FPGA
2010
ACM
14 years 4 months ago
2010
ACM
Monte Carlo based SSTA serves as the golden standard against alternative SSTA algorithms, but it is seldom used in practice due to its high computation time. In this paper, we acc...
ESOP
2012
Springer
12 years 3 months ago
2012
Springer
The existing call-by-need λ calculi describe lazy evaluation via equational logics. A programmer can use these logics to safely ascertain whether one term is behaviorally equivale...
PPDP
2005
Springer
14 years 29 days 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....
FLAIRS
2008
13 years 9 months ago
2008
Ontology alignment is regarded as one of the core tasks in many Web services. It is concerned with finding the correspondences between separate ontologies by identifying concepts ...