Lower bounds on type inference with subtypes
POPL '95 Proceedings of the 22nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
The algorithmic analysis of hybrid systems
Theoretical Computer Science - Special issue on hybrid systems
A Sampler of Formal Definitions
ACM Computing Surveys (CSUR)
Types and programming languages
Types and programming languages
Language Prototyping: An Algebraic Specification Approach: Vol. V
Language Prototyping: An Algebraic Specification Approach: Vol. V
Composing programming languages by combining action-semantics modules
Science of Computer Programming - Special issue: Language descriptions, tools and applications (LDTA'01)
Type-Checking Revisited: Modular Error-Handling
Proceedings of the International Workshop on Semantics of Specification Languages (SoSL)
Compiling TYPOL with Attribute Grammars
PLILP '88 Proceedings of the 1st International Workshop on Programming Language Implementation and Logic Programming
Satisfying Subtype Inequalities in Polynomial Space
SAS '97 Proceedings of the 4th International Symposium on Static Analysis
POPL '84 Proceedings of the 11th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Conference record of the 33rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Science of Computer Programming - The fourth workshop on language descriptions, tools, and applications (LDTA'04)
RTA'03 Proceedings of the 14th international conference on Rewriting techniques and applications
Flexible and extensible notations for modeling languages
FASE'07 Proceedings of the 10th international conference on Fundamental approaches to software engineering
Mapping modular SOS to rewriting logic
LOPSTR'02 Proceedings of the 12th international conference on Logic based program synthesis and transformation
Typing haskell with an attribute grammar
AFP'04 Proceedings of the 5th international conference on Advanced Functional Programming
Formally specified type checkers for domain specific languages: experience report
Proceedings of the Tenth Workshop on Language Descriptions, Tools and Applications
Hi-index | 0.00 |
Evolution of programming languages requires co-evolution of static analysis tools designed for these languages. Traditional approaches to static analysis, e.g., those based on Structural Operational Semantics (SOS), assume, however, that the syntax and the semantics of the programming language under consideration are fixed. Language modification is, therefore, likely to cause redevelopment of the analysis techniques and tools. Moreover, the redevelopment cost can discourage the language engineers from improving the language design. To address the co-evolution problem we suggest to base static analyses on modular structural operational semantics (MSOS). By using an intrinsically modular formalism, type rules can be added, removed or modified easily. We illustrate our approach by developing an MSOSbased type analysis technique for Chi, a domain specific language for hybrid systems engineering.