Sciweavers

329 search results - page 52 / 66
» Automatic Proofs for Scalecharts
Sort
View
VMCAI
2004
Springer
14 years 3 months ago
Construction of a Semantic Model for a Typed Assembly Language
Typed Assembly Languages (TALs) can be used to validate the safety of assembly-language programs. However, typing rules are usually trusted as axioms. In this paper, we show how to...
Gang Tan, Andrew W. Appel, Kedar N. Swadi, Dinghao...
ISSTA
2009
ACM
14 years 4 months ago
An annotation assistant for interactive debugging of programs with common synchronization idioms
This paper explores an approach to improving the practical usability of static verification tools for debugging synchronization idioms. Synchronization idioms such as mutual excl...
Tayfun Elmas, Ali Sezgin, Serdar Tasiran, Shaz Qad...
PLDI
2009
ACM
14 years 10 months ago
A decision procedure for subset constraints over regular languages
Reasoning about string variables, in particular program inputs, is an important aspect of many program analyses and testing frameworks. Program inputs invariably arrive as strings...
Pieter Hooimeijer, Westley Weimer
CADE
2008
Springer
14 years 10 months ago
Automated Induction with Constrained Tree Automata
We propose a procedure for automated implicit inductive theorem proving for equational specifications made of rewrite rules with conditions and constraints. The constraints are int...
Adel Bouhoula, Florent Jacquemard
ICFP
2005
ACM
14 years 9 months ago
Combining programming with theorem proving
Applied Type System (ATS) is recently proposed as a framework for designing and formalizing (advanced) type systems in support of practical programming. In ATS, the definition of ...
Chiyan Chen, Hongwei Xi