Sciweavers

1102 search results - page 31 / 221
» Generalizing Updates: From Models to Programs
Sort
View
DM
2007
125views more  DM 2007»
13 years 7 months ago
Generalized switch-setting problems
Switch-setting games like Lights Out are typically modelled as a graph, where the vertices represent switches and lamps, and the edges capture the switching rules. We generalize t...
Torsten Muetze
POPL
2009
ACM
14 years 8 months ago
Relaxed memory models: an operational approach
Memory models define an interface between programs written in some language and their implementation, determining which behaviour the memory (and thus a program) is allowed to hav...
Gérard Boudol, Gustavo Petri
FCCM
2006
IEEE
100views VLSI» more  FCCM 2006»
14 years 1 months ago
Enabling a Uniform Programming Model Across the Software/Hardware Boundary
In this paper, we present hthreads, a unifying programming model for specifying application threads running within a hybrid CPU/FPGA system. Threads are specified from a single p...
Erik Anderson, Jason Agron, Wesley Peck, Jim Steve...
BIRTHDAY
2005
Springer
14 years 1 months ago
Synthesis Revisited: Generating Statechart Models from Scenario-Based Requirements
Constructing a program from a specification is a long-known general and fundamental problem. Besides its theoretical interest, this question also has practical implications, since...
David Harel, Hillel Kugler, Amir Pnueli
CP
2009
Springer
14 years 8 months ago
From Model-Checking to Temporal Logic Constraint Solving
Abstract. In this paper, we show how model-checking can be generalized to temporal logic constraint solving, by considering temporal logic formulae with free variables over some do...
Aurélien Rizk, François Fages