407 search results - page 26 / 82 » Automatic Correctness Proofs for Logic Program Transformatio... |
CADE
2008
Springer
14 years 8 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...
SAC
2008
ACM
13 years 7 months ago
2008
ACM
Complexity in concurrent or distributed systems can be managed by dividing component into smaller components. However, such transformations change the coordination behaviour betwe...
IPL
2008
13 years 7 months ago
2008
Slicing is a program transformation technique with numerous applications, as it allows the user to focus on the parts of a program that are relevant for a given purpose. Ideally, ...
CNL
2009
13 years 8 months ago
2009
Abstract. This paper discusses the semi-formal language of mathematics and presents the Naproche CNL, a controlled natural language for mathematical authoring. Proof Representation...
PPOPP
2006
ACM
14 years 1 months ago
2006
ACM
We study a family of implementations for linked lists using finegrain synchronisation. This approach enables greater concurrency, but correctness is a greater challenge than for ...