1151 search results - page 166 / 231 » Collaborative Programming: Applications of Logic and Automat... |
182
Voted
ICSE
2007
IEEE-ACM
15 years 9 months ago
2007
IEEE-ACM
ACL2 is the latest inception of the Boyer-Moore theorem prover, the 2005 recipient of the ACM Software System Award. In the hands of an expert, it feels like a finely tuned race ...
134
click to vote
CADE
2008
Springer
16 years 3 months ago
2008
Springer
Interval-based methods are commonly used for computing numerical bounds on expressions and proving inequalities on real numbers. Yet they are hardly used in proof assistants, as th...
125
click to vote
CADE
2004
Springer
16 years 3 months ago
2004
Springer
LRR [3] is a rewriting system developed at the Computer Science Department of University of Houston. LRR has two subsystems: Smaran (for tabled rewriting), and TGR (for untabled re...
147
Voted
ASP
2005
Springer
15 years 9 months ago
2005
Springer
Despite all efforts on intelligent grounding, state-of-the-art answer set solvers still have huge memory requirements, because they compute the ground instantiation of the input pr...
147
Voted
LICS
2002
IEEE
15 years 8 months ago
2002
IEEE
Proof-Carrying Code (PCC) is a general framework for verifying the safety properties of machine-language programs. PCC proofs are usually written in a logic extended with language...