Sciweavers

949 search results - page 25 / 190
» Lightweight Formal Methods for Computer Algebra Systems
Sort
View
EDUTAINMENT
2007
Springer
14 years 1 months ago
UML in Action: Integrating Formal Methods in Industrial Design Education
When designing product behavior, the designer often needs to communicate to experts in computer software and protocols. In present-day software engineering, formal specification m...
Jun Hu, Philip Ross, Loe M. G. Feijs, Yuechen Qian
LICS
1998
IEEE
13 years 11 months ago
Compositional Analysis of Expected Delays in Networks of Probabilistic I/O Automata
Probabilistic I/O automata (PIOA) constitute a model for distributed or concurrent systems that incorporates a notion of probabilistic choice. The PIOA model provides a notion of ...
Eugene W. Stark, Scott A. Smolka
AISC
2008
Springer
13 years 9 months ago
Automating Side Conditions in Formalized Partial Functions
Abstract. Assumptions about the domains of partial functions are necessary in state-of-the-art proof assistants. On the other hand when mathematicians write about partial functions...
Cezary Kaliszyk
BIRTHDAY
2005
Springer
14 years 1 months ago
Simulating Algebraic High-Level Nets by Parallel Attributed Graph Transformation
The “classical” approach to represent Petri nets by graph transformation systems is to translate each transition of a specific Petri net to a graph rule (behavior rule). This ...
Claudia Ermel, Gabriele Taentzer, Roswitha Bardohl
EICS
2009
ACM
13 years 11 months ago
A formal approach supporting the comparative predictive assessment of the interruption-tolerance of interactive systems
This paper presents an approach for investigating in a predictive way potential disruptive effects of interruptions on task performance in a multitasking environment. The approach...
Philippe A. Palanque, Marco Winckler, Jean-Fran&cc...