Sciweavers

1788 search results - page 58 / 358
» Model Theory for Process Algebra
Sort
View
NGITS
1999
Springer
15 years 4 months ago
From Object-Process Diagrams to a Natural Object-Process Language
As the requirements for system analysis and design become more complex, the need for a natural, yet formal way of specifying system analysis findings and design decisions are becom...
Mor Peleg, Dov Dori
DCC
2006
IEEE
16 years 6 days ago
Basic Theory in Construction of Boolean Functions with Maximum Possible Annihilator Immunity
So far there is no systematic attempt to construct Boolean functions with maximum annihilator immunity. In this paper we present a construction keeping in mind the basic theory of...
Deepak Kumar Dalai, Subhamoy Maitra, Sumanta Sarka...
103
Voted
APLAS
2010
ACM
15 years 25 days ago
Verification of Tree-Processing Programs via Higher-Order Model Checking
Abstract. We propose a new method to verify that a higher-order, treeprocessing functional program conforms to an input/output specification. Our method reduces the verification pr...
Hiroshi Unno, Naoshi Tabuchi, Naoki Kobayashi
ESOP
2001
Springer
15 years 5 months ago
Modeling an Algebraic Stepper
Programmers rely on the correctness of the tools in their programming environments. In the past, semanticists have studied the correctness of compilers and compiler analyses, which...
John Clements, Matthew Flatt, Matthias Felleisen
ENTCS
2007
117views more  ENTCS 2007»
15 years 17 days ago
Relating Hybrid Chi to Other Formalisms
The hybrid χ (Chi) formalism is suited to modeling, simulation and verification of hybrid systems. It integrates concepts from dynamics and control theory with concepts from com...
D. A. van Beek, J. E. Rooda, Ramon R. H. Schiffele...