default search action
Fundamenta Informaticae, Volume 77
Volume 77, Number 1-2, 2007
- Jean-Raymond Abrial, Stefan Hallerstede:
Refinement, Decomposition, and Instantiation of Discrete Models: Application to Event-B. 1-28 - Richard Banach, Czeslaw Jeske, Michael Poppleton, Susan Stepney:
Retrenching the Purse: The Balance Enquiry Quandary, and Generalised and (1, 1) Forward Refinements. 29-69 - Roozbeh Farahbod, Vincenzo Gervasi, Uwe Glässer:
CoreASM: An Extensible ASM Execution Engine. 71-103 - Calvin Kai Fan Tang, Eugenia Ternovska:
Model Checking Abstract State Machines with Answer Set Programming. 105-141 - Susanne Graf, Andreas Prinz:
Time in State Machines. 143-174 - Seshadhri Comandur, Anil Seth, Somenath Biswas:
RAM Simulation of BGS Model of Abstract-state Machines. 175-185
Volume 77, Number 3, 2007
- Éric Badouel, Jules Chenou, Goulven Guillou:
An Axiomatization of the Token Game Based on Petri Algebras. 187-215 - Chin-Chen Chang, Wei-Liang Tai, Chia-Chen Lin:
A Novel Image Hiding Scheme Based on VQ and Hamming Distance. 217-228 - Yancang Li, Wanqing Li:
Adaptive Ant Colony Optimization Algorithm Based on Information Entropy: Foundation and Application. 229-242 - Mykola Pechenizkiy, Alexey Tsymbal, Seppo Puuronen, David W. Patterson:
Feature Extraction for Dynamic Integration of Classifiers. 243-275 - Piotr Porwik:
Efficient Algorithm of Affine Form Searching forWeakly Specified Boolean Function. 277-291
Volume 77, Number 4, 2007
- Thierry Coquand:
The Completeness of Typing for Context-Semantics. 293-301 - Amy P. Felty:
Tutorial Examples of the Semantic Approach to Foundational Proof-Carrying Code. 303-330 - Susumu Hayashi:
Can Proofs be Animated by Games? 331-343 - Andreas Abel, Thierry Coquand:
Untyped Algorithmic Equality for Martin-Löf's Logical Framework with Surjective Pairs. 345-395 - Amal Ahmed, Matthew Fluet, Greg Morrisett:
L3: A Linear Language with Locations. 397-449 - Ferruccio Damiani:
Rank 2 Intersection for Recursive Definitions. 451-488 - René David, Karim Nour:
Arithmetical Proofs of Strong Normalization Results for Symmetric ?-calculi. 489-510 - James Laird:
On the Expressiveness of Affine Programs with Non-local Control: The Elimination of Nesting in SPCF. 511-531
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.