Sciweavers

949 search results - page 45 / 190
» Lightweight Formal Methods for Computer Algebra Systems
Sort
View
TLCA
1993
Springer
13 years 11 months ago
A Logic for Parametric Polymorphism
In this paper we introduce a logic for parametric polymorphism. Just as LCF is a logic for the simply-typed λ-calculus with recursion and arithmetic, our logic is a logic for Sys...
Gordon D. Plotkin, Martín Abadi
ICDCS
2005
IEEE
14 years 1 months ago
Equational Approach to Formal Analysis of TLS
TLS has been formally analyzed with the OTS/CafeOBJ method. In the method, distributed systems are modeled as transition systems, which are written in terms of equations, and it i...
Kazuhiro Ogata, Kokichi Futatsugi
SIMULATION
2008
139views more  SIMULATION 2008»
13 years 7 months ago
Constitutive Hybrid Processes: a Process-Algebraic Semantics for Hybrid Bond Graphs
Models of physical systems have to be based on physical principles such as conservation of energy and continuity of power. These principles are inherently enforced by the bond gra...
Pieter J. L. Cuijpers, Jan F. Broenink, Pieter J. ...
DNA
2009
Springer
158views Bioinformatics» more  DNA 2009»
14 years 2 months ago
Design of a Biomolecular Device That Executes Process Algebra
Process algebras are widely used for defining the formal semantics of concurrent communicating processes. In process algebra, concurrent processes can be specified to execute di...
Urmi Majumder, John H. Reif
SSD
1993
Springer
152views Database» more  SSD 1993»
13 years 11 months ago
Realms: A Foundation for Spatial Data Types in Database Systems
: Spatial data types or algebras for database systems should (i) be fully general (which means, closed under set operations, hence e.g. a region value can be a set of polygons with...
Ralf Hartmut Güting, Markus Schneider