Sciweavers

949 search results - page 17 / 190
» Lightweight Formal Methods for Computer Algebra Systems
Sort
View
CORR
2004
Springer
142views Education» more  CORR 2004»
13 years 7 months ago
Modeling and Validating Hybrid Systems Using VDM and Mathematica
Hybrid systems are characterized by the hybrid evolution of their state: A part of the state changes discretely, the other part changes continuously over time. Typically, modern c...
Bernhard K. Aichernig, Reinhold Kainhofer
CL
2007
Springer
13 years 7 months ago
A bulk-synchronous parallel process algebra
The CCS (Calculus of Communicating Systems) process algebra is a well-known formal model of synchronization and communication. It is used for the analysis of safety and liveness i...
Armelle Merlin, Gaétan Hains
SYNASC
2008
IEEE
284views Algorithms» more  SYNASC 2008»
14 years 1 months ago
Graph Rewriting in Computational Origami
We formalize paper fold (origami) by graph rewriting. Origami tion is abstractly described by a rewrite system (O, ), where set of abstract origami’s and is a binary relation on ...
Tetsuo Ida
CADE
2008
Springer
14 years 7 months ago
On Automating the Calculus of Relations
Relation algebras provide abstract equational axioms for the calculus of binary relations. They name an established area of mathematics with various applications in computer scienc...
Georg Struth, Peter Höfner
FMSD
2006
183views more  FMSD 2006»
13 years 7 months ago
An algebraic theory for behavioral modeling and protocol synthesis in system 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 sy...
Jean-Pierre Talpin, Paul Le Guernic