4573 search results - page 779 / 915 » Automated Reasoning |
139
click to vote
CADE
2010
Springer
15 years 4 months ago
2010
Springer
Automated software verification and path-sensitive program analysis require the ability to distinguish executable program paths from those that are infeasible. To achieve this, pro...
119
click to vote
ENTCS
2007
15 years 3 months ago
2007
Safety is an important requirement for many modern systems. To ensure safety of complex critical systems, well-known safety analysis methods have been formalized. This holds in pa...
111
Voted
TCAD
2002
15 years 2 months ago
2002
Test scheduling is an important problem in system-on-a-chip (SOC) test automation. Efficient test schedules minimize the overall system test application time, avoid test resource c...
138
click to vote
CADE
2010
Springer
15 years 2 months ago
2010
Springer
Polynomial interpretations are a useful technique for proving termination of term rewrite systems. In an automated setting, termination tools are concerned with parametric polynomi...
120
Voted
CORR
2011
Springer
14 years 10 months ago
2011
Springer
We give a calculus for reasoning about the first-order fragment of classical logic that is adequate for giving the truth conditions of intuitionistic Kripke frames, and outline a...