Sciweavers

31387 search results - page 5992 / 6278
» Abstracting abstract machines
Sort
View
ICSE
2010
IEEE-ACM
15 years 8 months ago
Efficient hybrid typestate analysis by determining continuation-equivalent states
Typestate analysis determines whether a program violates a set of finite-state properties. Because the typestate-analysis problem is statically undecidable, researchers have propo...
Eric Bodden
CONEXT
2006
ACM
15 years 8 months ago
Optimal design of high density 802.11 WLANs
Abstract: The provisioning of high throughput performance infrastructure wireless networks necessitates the deployment of a high density of Access Points. While the latter improves...
Vivek P. Mhatre, Konstantina Papagiannaki
CPM
2005
Springer
100views Combinatorics» more  CPM 2005»
15 years 8 months ago
Hardness of Optimal Spaced Seed Design
Abstract. Speeding up approximate pattern matching is a line of research in stringology since the 80’s. Practically fast approaches belong to the class of filtration algorithms,...
François Nicolas, Eric Rivals
DIAGRAMS
2006
Springer
15 years 8 months ago
From Diagrams to Models by Analogical Transfer
Abstract. We present a method for constructing a teleological model of a drawing of a physical device through analogical transfer of the teleological model of the same device in an...
Patrick W. Yaner, Ashok K. Goel
ECAI
2006
Springer
15 years 8 months ago
Count-As Conditionals, Classification and Context
Abstract. Searle represents constitutive norms as count-as conditionals, written as `X counts as Y in context C'. Grossi et al. study a class of these conditionals as `in cont...
Guido Boella, Leendert W. N. van der Torre
« Prev « First page 5992 / 6278 Last » Next »