Sciweavers

107 search results - page 16 / 22
» Formal verification at higher levels of abstraction
Sort
View
TCS
2002
14 years 9 months ago
Tilings as a programming exercise
We investigate the problem of producing symmetric tilings by programs in a uniform way. By this, we mean that the construction of a tiling should be parameterized by the geometric...
Guy Cousineau
FAC
2008
100views more  FAC 2008»
14 years 10 months ago
Slicing communicating automata specifications: polynomial algorithms for model reduction
Abstract. Slicing is a program analysis technique that was originally introduced to improve program debugging and understanding. The purpose of a slicing algorithm is to remove the...
Sébastien Labbé, Jean-Pierre Gallois
IJSI
2008
126views more  IJSI 2008»
14 years 9 months ago
Modelling Route Instructions for Robust Human-Robot Interaction on Navigation Tasks
In this paper, we demonstrate the use of qualitative spatial modelling as the foundation for the conceptual representation of route instructions, to enable robust humanrobot intera...
Hui Shi, Bernd Krieg-Brückner
ICFP
2005
ACM
15 years 9 months ago
A computational approach to reflective meta-reasoning about languages with bindings
We present a foundation for a computational meta-theory of languages with bindings implemented in a computer-aided formal reasoning environment. Our theory provides the ability to...
Aleksey Nogin, Alexei Kopylov, Xin Yu, Jason Hicke...
ACSD
2004
IEEE
124views Hardware» more  ACSD 2004»
15 years 1 months ago
A Behavioral Type Inference System for Compositional System-on-Chip Design
The design productivity gap has been recognized by the semiconductor industry as one of the major threats to the continued growth of system-on-chips and embedded systems. Ad-hoc s...
Jean-Pierre Talpin, David Berner, Sandeep K. Shukl...