Sciweavers

1898 search results - page 179 / 380
» Weak Keys for IDEA
Sort
View
ENTCS
2007
83views more  ENTCS 2007»
13 years 9 months ago
Enhancing Theorem Prover Interfaces with Program Slice Information
This paper proposes an extension to theorem proving interfaces for use with proofdirected debugging and other disproof-based applications. The extension is based around tracking a...
Louise A. Dennis
ENTCS
2007
130views more  ENTCS 2007»
13 years 9 months ago
Specify, Compile, Run: Hardware from PSL
We propose to use a formal specification language as a high-level hardware description language. Formal languages allow for compact, unambiguous representations and yield designs...
Roderick Bloem, Stefan Galler, Barbara Jobstmann, ...
TCS
2008
13 years 9 months ago
Loop detection in term rewriting using the eliminating unfoldings
In this paper, we present a fully automatizable approach to detecting loops in standard term rewriting. Our method is based on semi-unification and an unfolding operation which pr...
Étienne Payet
TOMS
2008
87views more  TOMS 2008»
13 years 9 months ago
Efficient Contouring on Unstructured Meshes for Partial Differential Equations
We introduce three fast contouring algorithms for visualizing the solution of Partial Differential Equations based on the PCI (Pure Cubic Interpolant). The PCI is a particular pie...
Hassan Goldani-Moghaddam, Wayne H. Enright
AAMAS
2004
Springer
13 years 9 months ago
Tropos: An Agent-Oriented Software Development Methodology
Our goal in this paper is to introduce and motivate a methodology, called Tropos,1 for building agent oriented software systems. Tropos is based on two key ideas. First, the notion...
Paolo Bresciani, Anna Perini, Paolo Giorgini, Faus...