Sciweavers

408 search results - page 12 / 82
» Relation Algebras for Reasoning about Time and Space
Sort
View
AIEDAM
2006
89views more  AIEDAM 2006»
13 years 7 months ago
Design space exploration revisited
Design involves reasoning about descriptions of design artefacts, reasoning about design requirements and reasoning about design process objectives (such as keeping to deadlines an...
Pieter H. G. van Langen, Frances M. T. Brazier
IMECS
2007
13 years 9 months ago
Analysis of a Mixed-Signal Circuit in Hybrid Process Algebra ACPsrt
— ACPsrt hs is a hybrid process algebra obtained by extending a combination of two existing extensions of Algebra of Communicating Processes (ACP), namely the process algebra wit...
Ka L. Man, Michel P. Schellekens
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
BIRTHDAY
2010
Springer
13 years 8 months ago
Metrization Theorem for Space-Times: From Urysohn's Problem towards Physically Useful Constructive Mathematics
In the early 1920s, Pavel Urysohn proved his famous lemma (sometimes referred to as "first non-trivial result of point set topology"). Among other applications, this lemm...
Vladik Kreinovich
POPL
2006
ACM
14 years 7 months ago
Fast and loose reasoning is morally correct
Functional programmers often reason about programs as if they were written in a total language, expecting the results to carry over to non-total (partial) languages. We justify su...
Nils Anders Danielsson, John Hughes, Patrik Jansso...