Sciweavers

1948 search results - page 272 / 390
» Formalizing Mirror Theory
Sort
View
STOC
2010
ACM
216views Algorithms» more  STOC 2010»
16 years 2 months ago
The HOM problem is decidable
We close affirmatively a question which has been open for long time: decidability of the HOM problem. The HOM problem consists in determining, given a tree homomorphism D and a re...
Guillem Godoy, Omer Giménez, Lander Ramos and Car...
TPHOL
2007
IEEE
15 years 11 months 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
CMSB
2007
Springer
15 years 11 months ago
Expressive Models for Synaptic Plasticity
We explore some presynaptic mechanisms of the calyx of Held synapse through a stochastic model. The model, drawn from a kinetic approach developed in literature, exploits process c...
Andrea Bracciali, Marcello Brunelli, Enrico Catald...
EMSOFT
2007
Springer
15 years 11 months ago
Proving the absence of run-time errors in safety-critical avionics code
We explain the design of the interpretation-based static analyzer Astr´ee and its use to prove the absence of run-time errors in safety-critical codes. Categories and Subject Des...
Patrick Cousot
157
Voted
PLDI
2005
ACM
15 years 11 months ago
Composing security policies with polymer
We introduce a language and system that supports definition and composition of complex run-time security policies for Java applications. Our policies are comprised of two sorts o...
Lujo Bauer, Jay Ligatti, David Walker