Sciweavers

2343 search results - page 459 / 469
» Structure and Interpretation of Computer Programs
Sort
View
ICMT
2009
Springer
16 years 1 months ago
A Simple Game-Theoretic Approach to Checkonly QVT Relations
Abstract. The QVT Relations (QVT-R) transformation language allows the definition of bidirectional model transformations, which are required in cases where a two (or more) models ...
Perdita Stevens
179
Voted
DSRT
2008
IEEE
16 years 27 days ago
Interfacing and Coordination for a DEVS Simulation Protocol Standard
The DEVS formalism has been adopted and developed independently by many research teams, which led to various DEVS implementation versions. Consequently, different DEVS implementat...
Khaldoon Al-Zoubi, Gabriel A. Wainer
161
Voted
BIBE
2007
IEEE
128views Bioinformatics» more  BIBE 2007»
16 years 23 days ago
QOMA2: Optimizing the alignment of many sequences
Abstract—We consider the problem of aligning multiple protein sequences with the goal of maximizing the SP (Sum-of-Pairs) score, when the number of sequences is large. The QOMA (...
Xu Zhang, Tamer Kahveci
189
Voted
TPHOL
2007
IEEE
16 years 21 days ago
Using XCAP to Certify Realistic Systems Code: Machine Context Management
Formal, modular, and mechanized verification of realistic systems code is desirable but challenging. Verification of machine context management (a basis of multi-tasking) is one ...
Zhaozhong Ni, Dachuan Yu, Zhong Shao
CSL
2007
Springer
16 years 18 days ago
From Proofs to Focused Proofs: A Modular Proof of Focalization in Linear Logic
Abstract. Probably the most significant result concerning cut-free sequent calculus proofs in linear logic is the completeness of focused proofs. This completeness theorem has a n...
Dale Miller, Alexis Saurin