Sciweavers

222 search results - page 14 / 45
» Development of Correct Graph Transformation Systems
Sort
View
DAC
1995
ACM
13 years 11 months ago
Rephasing: A Transformation Technique for the Manipulation of Timing Constraints
- We introduce a transformation, named rephasing, that manipulates the timing parameters in control-dataflow graphs. Traditionally high-level synthesis systems for DSP have either ...
Miodrag Potkonjak, Mani B. Srivastava
ICFP
2006
ACM
14 years 7 months ago
Modular development of certified program verifiers with a proof assistant
I report on an experience using the Coq proof assistant to develop a program verification tool with a machine-checkable proof of full correctness. The verifier is able to prove me...
Adam J. Chlipala
ISSE
2010
13 years 6 months ago
An integrated multi-view model evolution framework
A UML model of a software system can be represented by a sequence of model transformations, starting from an empty model. To effectively support the design of complex systems, tra...
Volker Stolz
BIRTHDAY
2010
Springer
13 years 5 months ago
Termination Graphs for Java Bytecode
To prove termination of Java Bytecode (JBC) automatically, we transform JBC to finite termination graphs which represent all possible runs of the program. Afterwards, the graph can...
Marc Brockschmidt, Carsten Otto, Christian von Ess...
ECBS
2002
IEEE
118views Hardware» more  ECBS 2002»
14 years 13 days ago
On the Relation between Design Contracts and Errors: A Software Development Strategy
When designing a software module or system, a systems engineer must consider and differentiate between how the system responds to external and internal errors. External errors can...
Eivind J. Nordby, Martin Blom, Anna Brunstrom