Sciweavers

4502 search results - page 374 / 901
» Regular Model Checking
Sort
View
ICSOC
2010
Springer
15 years 5 months ago
Service Discovery Using Communication Fingerprints
A request to a service registry must be answered with a service that fits in several regards, including semantic compatibility, non-functional compatibility, and interface compati...
Olivia Oanea, Jan Sürmeli, Karsten Wolf
TSE
2010
110views more  TSE 2010»
15 years 5 months ago
Proofs from Tests
We present an algorithm Dash to check if a program P satisfies a safety property ϕ. The unique feature of the algorithm is that it uses only test generation operations, and nes ...
Nels E. Beckman, Aditya V. Nori, Sriram K. Rajaman...
TEC
2002
94views more  TEC 2002»
15 years 6 months ago
Knowledge-intensive genetic discovery in foreign exchange markets
Abstract--This paper considers the discovery of trading decision models from high-frequency foreign exchange (FX) markets data using genetic programming (GP). It presents a domain-...
Siddhartha Bhattacharyya, Olivier V. Pictet, Gille...
214
Voted
DALT
2008
Springer
15 years 8 months ago
Abstracting and Verifying Strategy-Proofness for Auction Mechanisms
ing and Verifying Strategy-proofness for Auction Mechanisms E. M. Tadjouddine, F. Guerin, and W. Vasconcelos Department of Computing Science, King's College, University of Abe...
Emmanuel M. Tadjouddine, Frank Guerin, Wamberto We...
173
Voted
DATE
2006
IEEE
117views Hardware» more  DATE 2006»
16 years 26 days ago
Formal verification of systemc designs using a petri-net based representation
This paper presents an effective approach to formally verify SystemC designs. The approach translates SystemC models into a Petri-Net based representation. The Petri-net model is ...
Daniel Karlsson, Petru Eles, Zebo Peng