Sciweavers

596 search results - page 11 / 120
» Complexity Analysis by Graph Rewriting
Sort
View
PEPM
2010
ACM
13 years 9 months ago
A3PAT, an approach for certified automated termination proofs
Software engineering, automated reasoning, rule-based programming or specifications often use rewriting systems for which termination, among other properties, may have to be ensur...
Evelyne Contejean, Andrey Paskevich, Xavier Urbain...
CCE
2006
13 years 8 months ago
New approaches for representing, analyzing and visualizing complex kinetic transformations
Complex kinetic mechanisms involving thousands of reacting species and tens of thousands of reactions are currently required for the rational analysis of modern combustion systems...
Ioannis P. Androulakis
BIRTHDAY
2005
Springer
14 years 1 months ago
Expander2
Expander2 is a flexible multi-purpose workbench for interactive rewriting, verification, constraint solving, flow graph analysis and other procedures that build up proofs or co...
Peter Padawitz
ICSE
2001
IEEE-ACM
14 years 10 days ago
Using Transformation Systems for Software Maintenance and Reengineering
Software maintenance costs dominate software engineering costs, partly because most such engineering is done manually. Program Transformation tools leverage an engineer-provided b...
Ira D. Baxter
ENTCS
2006
103views more  ENTCS 2006»
13 years 8 months ago
Static Equivalence is Harder than Knowledge
There are two main ways of defining secrecy of cryptographic protocols. The first version checks if the adversary can learn the value of a secret parameter. In the second version,...
Johannes Borgström