Sciweavers

718 search results - page 24 / 144
» Extraction of Structured Programs from Specification Proofs
Sort
View
ASPDAC
2008
ACM
106views Hardware» more  ASPDAC 2008»
13 years 9 months ago
Verifying full-custom multipliers by Boolean equivalence checking and an arithmetic bit level proof
—In this paper we describe a practical methodology to formally verify highly optimized, industrial multipliers. We a multiplier description language which abstracts from low-leve...
Udo Krautz, Markus Wedler, Wolfgang Kunz, Kai Webe...
ENTCS
2006
109views more  ENTCS 2006»
13 years 8 months ago
Specifications via Realizability
We present a system, called RZ, for automatic generation of program specifications from mathematical theories. We translate mathematical theories to specifications by computing th...
Andrej Bauer, Christopher A. Stone
SCP
2010
123views more  SCP 2010»
13 years 3 months ago
Slicing for architectural analysis
Current software development often relies on non trivial coordination logic for combining autonomous services, eventually running on different platforms. As a rule, however, such ...
Nuno F. Rodrigues, Luís Soares Barbosa
AMAST
2004
Springer
14 years 12 days ago
A Language for Configuring Multi-level Specifications
Abstract. This paper shows how systems can be built from their component parts with specified sharing. Its principle contribution is a modular language for configuring systems. A c...
Gillian Hill, Steven Vickers
EUROCAST
2007
Springer
122views Hardware» more  EUROCAST 2007»
14 years 16 days ago
Generation of Indexes for Compiling Efficient Parsers from Formal Specifications
abstract Parsing schemata [4] provide a formal, simple and uniform way to describe, analyze and compare different parsing algorithms. The notion of a parsing schema comes from cons...
Carlos Gómez-Rodríguez, Miguel A. Al...