Sciweavers

300 search results - page 57 / 60
» Using probabilistic reasoning to automate software tuning
Sort
View
POPL
2010
ACM
15 years 6 months ago
Counterexample-Guided Focus
The automated inference of quantified invariants is considered one of the next challenges in software verification. The question of the right precision-efficiency tradeoff for the...
Andreas Podelski, Thomas Wies
CADE
2004
Springer
15 years 9 months ago
Rewriting Logic Semantics: From Language Specifications to Formal Analysis Tools
Formal semantic definitions of concurrent languages, when specified in a well-suited semantic framework and supported by generic and efficient formal tools, can be the basis of pow...
José Meseguer, Grigore Rosu
ICLP
2004
Springer
15 years 2 months ago
Applying CLP to Predict Extra-Functional Properties of Component-Based Models
A component is the basic re-usable unit of composition to build composite systems by connecting to others through their provided and required ports. Checking the functional complia...
Olivier Defour, Jean-Marc Jézéquel, ...
PATAT
2004
Springer
130views Education» more  PATAT 2004»
15 years 2 months ago
Learning User Preferences in Distributed Calendar Scheduling
Abstract. Within the field of software agents, there has been increasing interest in automating the process of calendar scheduling in recent years. Calendar (or meeting) schedulin...
Jean Oh, Stephen F. Smith
101
Voted
WWW
2005
ACM
15 years 10 months ago
A service creation environment based on end to end composition of Web services
The demand for quickly delivering new applications is increasingly becoming a business imperative today. Application development is often done in an ad hoc manner, without standar...
Vikas Agarwal, Koustuv Dasgupta, Neeran M. Karnik,...