SDE 3 Proceedings of the third ACM SIGSOFT/SIGPLAN software engineering symposium on Practical software development environments
Mechanizing CSP Trace Theory in Higher Order Logic
IEEE Transactions on Software Engineering
The temporal logic of reactive and concurrent systems
The temporal logic of reactive and concurrent systems
Compiling with continuations
SPARE: A Development Environment for Program Analysis Algorithms
IEEE Transactions on Software Engineering
The design and implementation of hierarchical software systems with reusable components
ACM Transactions on Software Engineering and Methodology (TOSEM)
Design patterns: elements of reusable object-oriented software
Design patterns: elements of reusable object-oriented software
A graphical interval logic for specifying concurrent systems
ACM Transactions on Software Engineering and Methodology (TOSEM)
The design and evolution of C++
The design and evolution of C++
ICSE '97 Proceedings of the 19th international conference on Software engineering
Building reliable, high-performance communication systems from components
Proceedings of the seventeenth ACM symposium on Operating systems principles
Proceedings of the 3rd ACM international workshop on Data warehousing and OLAP
Ninth International Conference on Information and Knowledge Management
Computer
Lightweight analysis of operational specifications using inference graphs
ICSE '01 Proceedings of the 23rd International Conference on Software Engineering
A component-based approach to building formal analysis tools
ICSE '01 Proceedings of the 23rd International Conference on Software Engineering
Modular verification of collaboration-based software designs
Proceedings of the 8th European software engineering conference held jointly with 9th ACM SIGSOFT international symposium on Foundations of software engineering
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Object-Oriented Software Evolution
IEEE Transactions on Software Engineering
Implementing Layered Designs with Mixin Layers
ECCOP '98 Proceedings of the 12th European Conference on Object-Oriented Programming
OPEN/CÆSAR: An OPen Software Architecture for Verification, Simulation, and Testing
TACAS '98 Proceedings of the 4th International Conference on Tools and Algorithms for Construction and Analysis of Systems
A Framework for Multi-Notation Requirements Specification and Analysis
ICRE '00 Proceedings of the 4th International Conference on Requirements Engineering (ICRE'00)
Mapping Template Semantics to SMV
Proceedings of the 19th IEEE international conference on Automated software engineering
Formal interpreters for diagram notations
ACM Transactions on Software Engineering and Methodology (TOSEM)
Reasoning about real-time statecharts in the presence of semantic variations
Proceedings of the 20th IEEE/ACM international Conference on Automated software engineering
Research Directions in Requirements Engineering
FOSE '07 2007 Future of Software Engineering
Prescriptive semantics for big-step modelling languages
FASE'10 Proceedings of the 13th international conference on Fundamental Approaches to Software Engineering
Code generation for a family of executable modelling notations
Software and Systems Modeling (SoSyM)
Hi-index | 0.00 |
Amalia is a generator framework for constructing analyzers for operationally defined formal notations. These generated analyzers are components that are designed for customization and integration into a larger environment. The customizability and efficiency of Amalia analyzers owe to a computational structure called an inference graph. This paper describes this structure, how inference graphs enable Amalia to generate analyzers for operational specifications, and how we build in assurance. On another level, this paper illustrates how to balance the need for assurance, which typically implies a formal proof obligation, against other design concerns, whose solutions leverage design techniques that are not (yet) accompanied by mature proof methods. We require Amalia-generated designs to be transparent with respect to the formal semantic models upon which they are based. Inference graphs are complex structures that incorporate many design optimizations. While not formally verifiable, their fidelity with respect to a formal operational semantics can be discharged by inspection.