Sciweavers

575 search results - page 5 / 115
» Transition systems for designing and reasoning about norms
Sort
View
AISC
1998
Springer
15 years 3 months ago
Reasoning About Coding Theory: The Benefits We Get from Computer Algebra
The use of computer algebra is usually considered beneficial for mechanised reasoning in mathematical domains. We present a case study, in the application domain of coding theory, ...
Clemens Ballarin, Lawrence C. Paulson
VL
2002
IEEE
107views Visual Languages» more  VL 2002»
15 years 4 months ago
Reasoning about Many-to-Many Requirement Relationships in Spreadsheets
To help improve the reliability of spreadsheets created by end users, we are working to allow users to communicate the purpose and other underlying information about their spreads...
Laura Beckwith, Margaret M. Burnett, Curtis R. Coo...
AMAI
2007
Springer
14 years 11 months ago
Reasoning about non-immediate triggers in biological networks
Modeling molecular interactions in biological networks is important from various perspectives such as predicting side effects of drugs, explaining unusual cellular behavior and dr...
Nam Tran, Chitta Baral
SIGSOFT
1998
ACM
15 years 3 months ago
Reasoning about Implicit Invocation
Implicit invocation SN92, GN91] has become an important architectural style for large-scale system design and evolution. This paper addresses the lack of speci cation and veri cat...
David Garlan, Somesh Jha, David Notkin
FMCAD
2000
Springer
15 years 2 months ago
The Semantics of Verilog Using Transition System Combinators
Abstract. Since the advent of model checking it is becoming more common for languages to be given a semantics in terms of transition systems. Such semantics allow to model check pr...
Gordon J. Pace