Sciweavers

325 search results - page 32 / 65
» Proofs of Restricted Shuffles
Sort
View
FMCO
2008
Springer
133views Formal Methods» more  FMCO 2008»
13 years 11 months ago
BML and Related Tools
The Bytecode Modeling Language (BML) is a specication for Java bytecode, that provides a high level of abstraction, while not restricting the format of the bytecode. Notably, BML s...
Jacek Chrzaszcz, Marieke Huisman, Aleksy Schubert
PLANX
2007
13 years 11 months ago
XPath Typing Using a Modal Logic with Converse for Finite Trees
We present an algorithm to solve XPath decision problems under regular tree type constraints and show its use to statically typecheck XPath queries. To this end, we prove the deci...
Pierre Genevès, Nabil Layaïda, Alan Sc...
PICS
2001
13 years 11 months ago
Measuring Visual Threshold of Inkjet Banding
Banding can be a major defect in inkjet printing. Knowing the visual sensitivity threshold of inkjet banding is therefore useful for understanding and pushing the technological li...
Chengwu Cui, Dingcai Cao, Shaun T. Love
AMAI
1998
Springer
13 years 9 months ago
Generalization and Specialization Strategies for Learning r.e. Languages
Overgeneralization is a major issue in the identification of grammars for formal languages from positive data. Different formulations of generalization and specialization strate...
Sanjay Jain, Arun Sharma
ACSAC
2009
IEEE
14 years 1 months ago
Justifying Integrity Using a Virtual Machine Verifier
Emerging distributed computing architectures, such as grid and cloud computing, depend on the high integrity execution of each system in the computation. While integrity measuremen...
Joshua Schiffman, Thomas Moyer, Christopher Shal, ...