Sciweavers

1988 search results - page 178 / 398
» Engineering formal metatheory
Sort
View
CICLING
2007
Springer
16 years 22 days ago
The Non-associativity of Polarized Tree-Based Grammars
Abstract. Polarities are used to sanction grammar fragment combination in high level tree-based formalisms such as eXtenssible MetaGrammar (XMG) and polarized unification grammars...
Yael Cohen-Sygal, Shuly Wintner
FSTTCS
2007
Springer
16 years 22 days ago
Program Analysis Using Weighted Pushdown Systems
Abstract. Pushdown systems (PDSs) are an automata-theoretic formalism for specifying a class of infinite-state transition systems. Infiniteness comes from the fact that each con...
Thomas W. Reps, Akash Lal, Nicholas Kidd
EUROMICRO
2006
IEEE
16 years 19 days ago
A Method for Component-Based Software and System Development
— We propose a method for component-based software and system development, where the interoperability between the different components is given special consideration. The method ...
Denis Hatebur, Maritta Heisel, Jeanine Souqui&egra...
SEW
2006
IEEE
16 years 17 days ago
Integrating Probability with Time and Shared-Variable Concurrency
Complex software systems typically involve features like time, concurrency and probability, where probabilistic computations play an increasing role. It is challenging to formaliz...
Huibiao Zhu, Shengchao Qin, Jifeng He, Jonathan P....
TLDI
2005
ACM
126views Formal Methods» more  TLDI 2005»
16 years 3 days ago
Type inference for atomicity
Atomicity is a fundamental correctness property in multithreaded programs. This paper presents an algorithm for verifying atomicity via type inference. The underlying type system ...
Cormac Flanagan, Stephen N. Freund, Marina Lifshin