Sciweavers

799 search results - page 146 / 160
» A Logic for Abstract State Machines
Sort
View
88
Voted
ISAAC
2007
Springer
135views Algorithms» more  ISAAC 2007»
15 years 3 months ago
Fast Evaluation of Union-Intersection Expressions
Abstract. We show how to represent sets in a linear space data structure such that expressions involving unions and intersections of sets can be computed in a worst-case efficient ...
Philip Bille, Anna Pagh, Rasmus Pagh
COMPSAC
2005
IEEE
15 years 3 months ago
Detecting Intrusions Specified in a Software Specification Language
To protect software against malicious activities, organizations are required to monitor security breaches. Intrusion Detection Systems (IDS) are those kinds of monitoring tools th...
Mohammad Feroz Raihan, Mohammad Zulkernine
ATVA
2005
Springer
132views Hardware» more  ATVA 2005»
15 years 3 months ago
Flat Counter Automata Almost Everywhere!
Abstract. This paper argues that flatness appears as a central notion in the verification of counter automata. A counter automaton is called flat when its control graph can be ...
Jérôme Leroux, Grégoire Sutre
100
Voted
ESWS
2004
Springer
15 years 3 months ago
Learning to Harvest Information for the Semantic Web
Abstract. In this paper we describe a methodology for harvesting information from large distributed repositories (e.g. large Web sites) with minimum user intervention. The methodol...
Fabio Ciravegna, Sam Chapman, Alexiei Dingli, Yori...
IFM
2004
Springer
15 years 3 months ago
Verifying Controlled Components
Recent work on combining CSP and B has provided ways of describing systems comprised of components described in both B (to express requirements on state) and CSP (to express intera...
Steve Schneider, Helen Treharne