|
|
Venues (Conferences, Journals, ...)
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 1404 occurrences of 649 keywords
|
|
|
Results
Found 2636 publication records. Showing 2636 according to the selection in the facets
Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
100 | Takahiro Nakano, Masahiro Nagamatu |
Lagrange Neural Network for Solving CSP Which Includes Linear Inequality Constraints. |
ICANN (2) |
2005 |
DBLP DOI BibTeX RDF |
|
93 | Takahiro Nakano, Masahiro Nagamatu |
Solving CSP by Lagrangian Method with Importance of Constraints. |
Intelligent Information Processing |
2004 |
DBLP DOI BibTeX RDF |
neural network, CSP, constraint satisfaction problem, Lagrangian method |
86 | Neil Evans, Helen Treharne |
Interactive tool support for CSP || B consistency checking. |
Formal Aspects Comput. |
2007 |
DBLP DOI BibTeX RDF |
Formal method integration, Tool supported verification, Rely/guarantee techniques, CSP, B |
86 | Alistair A. McEwan, Steve A. Schneider |
A verified development of hardware using CSP∥B. |
MEMOCODE |
2006 |
DBLP DOI BibTeX RDF |
|
79 | Steve A. Schneider, Helen Treharne, Neil Evans |
Chunks: Component Verification in CSP||B. |
IFM |
2005 |
DBLP DOI BibTeX RDF |
Component based verification, decomposition, CSP, B-Method |
79 | Muan Yong Ng, Michael J. Butler |
Tool Support for Visualizing CSP in UML. |
ICFEM |
2002 |
DBLP DOI BibTeX RDF |
UML, CSP, class diagram, state diagram |
73 | Dániel Marx |
Tractable hypergraph properties for constraint satisfaction and conjunctive queries. |
STOC |
2010 |
DBLP DOI BibTeX RDF |
submodular width, constraint satisfaction, conjunctive queries, fixed-parameter tractability |
72 | Renata Kaufman, Augusto Sampaio, Alexandre Mota 0001 |
Formalisation and Analysis of Objects as CSP Processes. |
SBMF |
2009 |
DBLP DOI BibTeX RDF |
Design Pattern, CSP, Object-Z, Object-Oriented Specification |
72 | Michael Möller 0002, Ernst-Rüdiger Olderog, Holger Rasch, Heike Wehrheim |
Linking CSP-OZ with UML and Java: A Case Study. |
IFM |
2004 |
DBLP DOI BibTeX RDF |
Java, UML, CSP, assertions, Object-Z, runtime checking |
72 | John Derrick, Graeme Smith 0001 |
Structural Refinement of Systems Specified in Object-Z and CSP. |
Formal Aspects Comput. |
2003 |
DBLP DOI BibTeX RDF |
ensp, Integrated formal methods, Refinement, CSP, Object-Z |
72 | Ernst-Rüdiger Olderog, Heike Wehrheim |
Specification and Inheritance in CSP-OZ. |
FMCO |
2002 |
DBLP DOI BibTeX RDF |
failure divergence semantics, safety and liveness properties, model-checking, CSP, inheritance, Object-Z, FDR |
71 | William B. Gardner |
Converging CSP specifications and C++ programming via selective formalism. |
ACM Trans. Embed. Comput. Syst. |
2005 |
DBLP DOI BibTeX RDF |
hardware/software codesign, Executable specifications, object-oriented application frameworks |
71 | William B. Gardner |
Bridging CSP and C++ with Selective Formalism and Executable Specifications. |
MEMOCODE |
2003 |
DBLP DOI BibTeX RDF |
|
71 | Clemens Fischer, Ernst-Rüdiger Olderog, Heike Wehrheim |
A CSP View on UML-RT Structure Diagrams. |
FASE |
2001 |
DBLP DOI BibTeX RDF |
|
65 | Andrei A. Bulatov, Víctor Dalmau |
Towards a Dichotomy Theorem for the Counting Constraint Satisfaction Problem. |
FOCS |
2003 |
DBLP DOI BibTeX RDF |
|
64 | Jin-yi Cai, Pinyan Lu, Mingji Xia |
Holant problems and counting CSP. |
STOC |
2009 |
DBLP DOI BibTeX RDF |
holant problem, holographic reduction, CSP, polynomial interpolation |
64 | Yannis Argyropoulos, Kostas Stergiou 0001 |
A Study of SAT-Based Branching Heuristics for the CSP. |
SETN |
2008 |
DBLP DOI BibTeX RDF |
Branching Heuristics, CSP, SAT |
64 | Michael J. Butler |
csp2B: A Practical Approach to Combining CSP and B. |
Formal Aspects Comput. |
2000 |
DBLP DOI BibTeX RDF |
Refinement, CSP, B Method |
64 | Jin Song Dong, Ping Hao, Jun Sun 0001, Xian Zhang 0007 |
A Reasoning Method for Timed CSP Based on Constraint Solving. |
ICFEM |
2006 |
DBLP DOI BibTeX RDF |
|
63 | Igor Razgon, Amnon Meisels |
A CSP Search Algorithm with Responsibility Sets and Kernels. |
Constraints An Int. J. |
2007 |
DBLP DOI BibTeX RDF |
CSP search algorithm, FC-RKP, MAC-RKP, Kernel |
63 | John Derrick |
Timed CSP and Object-Z. |
ZB |
2003 |
DBLP DOI BibTeX RDF |
Refinement, Object-Z, Timed CSP |
63 | Heike Wehrheim |
Data Abstraction Techniques in the Validation of CSP-OZ Specifications. |
Formal Aspects Comput. |
2000 |
DBLP DOI BibTeX RDF |
Integrated formal methods, CSP-OZ, Verification, Data abstraction |
59 | N. Liu, M. T. Liu |
Conformity analysis for communication protocols. |
SIGCOMM |
1986 |
DBLP DOI BibTeX RDF |
CSP, CSP, CSP |
58 | Jun Sun 0001, Jin Song Dong |
Model Checking Live Sequence Charts. |
ICECCS |
2005 |
DBLP DOI BibTeX RDF |
Verification, CSP, FDR, LSCs |
58 | Marco A. Boschetti, Aristide Mingozzi, Salvatore Ricciardelli |
An Exact Algorithm for the Simplified Multiple Depot Crew Scheduling Problem. |
Ann. Oper. Res. |
2004 |
DBLP DOI BibTeX RDF |
dual heuristics, personal scheduling, set partitioning |
58 | Juan Li 0001, Mingshu Li 0001, Zhanchun Wu, Qing Wang 0001 |
A Metamodel for the CMM Software Process. |
ISPA |
2004 |
DBLP DOI BibTeX RDF |
|
57 | Michael Leuschel, Marc Fontaine |
Probing the Depths of CSP-M: A New fdr-Compliant Validation Tool. |
ICFEM |
2008 |
DBLP DOI BibTeX RDF |
Integrated Formal Methods, Specification Language Design, Model Checking, Animation, Logic Programming, CSP, Tool Support, B-Method |
57 | Kirsten Winter |
Formalising Behaviour Trees with CSP. |
IFM |
2004 |
DBLP DOI BibTeX RDF |
Behaviour Trees, model checking, Requirements engineering, CSP |
57 | Incheon Paik, Daisuke Maruyama |
Automatic Web Services Composition Using Combining HTN and CSP. |
CIT |
2007 |
DBLP DOI BibTeX RDF |
|
57 | Daisuke Maruyama, Incheon Paik, Mitsuteru Shinozawa |
A Flexible and Dynamic CSP Solver for Web Service Composition in the Semantic Web Environment. |
CIT |
2006 |
DBLP DOI BibTeX RDF |
|
57 | John D. Carter, William B. Gardner |
A Formal CSP Framework for Message-Passing HPC Programming. |
CCECE |
2006 |
DBLP DOI BibTeX RDF |
|
57 | Steve A. Schneider, Helen Treharne |
CSP theorems for communicating B machines. |
Formal Aspects Comput. |
2005 |
DBLP DOI BibTeX RDF |
|
57 | Yoshinao Isobe, Markus Roggenbach |
A Generic Theorem Prover of CSP Refinement. |
TACAS |
2005 |
DBLP DOI BibTeX RDF |
|
57 | Frank S. de Boer, Catuscia Palamidessi |
Embedding as a Tool for Language Comparison: On the CSP Hierarchy. |
CONCUR |
1991 |
DBLP DOI BibTeX RDF |
concurrent logic languages, embedding, compositional semantics |
56 | Josep Argelich, Alba Cabiscol, Inês Lynce, Felip Manyà |
Encoding Max-CSP into Partial Max-SAT. |
ISMVL |
2008 |
DBLP DOI BibTeX RDF |
Minimal Support, Max-CSP, Partial Max-SAT, Encodings |
55 | John J. Zic |
Time-Constrained Buffer Specifications in CSP+T and Timed CSP. |
ACM Trans. Program. Lang. Syst. |
1994 |
DBLP DOI BibTeX RDF |
real-time algebraic languages |
55 | Alfonso Gerevini, Ivan Serina |
Planning as Propositional CSP: From Walksat to Local Search Techniques for Action Graphs. |
Constraints An Int. J. |
2003 |
DBLP DOI BibTeX RDF |
planning as CSP, propositional CSP, planning graphs, planning, local search, heuristic search |
52 | Hélène Kanso |
Résolution des problèmes (W)CSP et #CSP par approches structurelles: Calcul et exploitation dynamique de décompositions arborescentes. (Solving (W)CSP and #CSP problems by structural approaches: computation and dynamic exploitation of tree decompositions). |
|
2017 |
RDF |
|
51 | Gérard Berry, S. Ramesh 0001, R. K. Shyamasundar |
Communicating Reactive Processes. |
POPL |
1993 |
DBLP DOI BibTeX RDF |
CSP, CSP |
51 | Leo Freitas, Jim Woodcock 0001 |
FDR Explorer. |
Formal Aspects Comput. |
2009 |
DBLP DOI BibTeX RDF |
Model checking, Refinement, CSP, Automata, Labelled transition systems, FDR |
51 | Marielle Doche, Andrew M. Gravell |
Extraction of Abstraction Invariants for Data Refinement. |
ZB |
2002 |
DBLP DOI BibTeX RDF |
failure refinement, distributed system, Formal specification, CSP, B, data refinement |
51 | Jochen Hoenicke, Ernst-Rüdiger Olderog |
Combining Specification Techniques for Processes, Data and Time. |
IFM |
2002 |
DBLP DOI BibTeX RDF |
transformational semantic, model-checking, CSP, Object-Z, real-time processes, FDR, Duration Calculus, UPPAAL |
51 | Peter Jonsson, Andrei A. Krokhin, Fredrik Kuivinen |
Ruling Out Polynomial-Time Approximation Schemes for Hard Constraint Satisfaction Problems. |
CSR |
2007 |
DBLP DOI BibTeX RDF |
maximum constraint satisfaction, complexity, approximability |
51 | Miroslav N. Velev |
Exploiting hierarchy and structure to efficiently solve graph coloring as SAT. |
ICCAD |
2007 |
DBLP DOI BibTeX RDF |
|
51 | Andrei A. Bulatov |
A dichotomy theorem for constraint satisfaction problems on a 3-element set. |
J. ACM |
2006 |
DBLP DOI BibTeX RDF |
dichotomy theorem, homomorphism problem, complexity, Constraint satisfaction problem |
51 | Katsutoshi Hirayama, Makoto Yokoo |
An Approach to Over-constrained Distributed Constraint Satisfaction Problems: Distributed Hierarchical Constraint Satisfaction. |
ICMAS |
2000 |
DBLP DOI BibTeX RDF |
|
51 | Luigi Portinale |
Modeling and Solving Constraint Satisfaction Problems through Petri Nets. |
ICATPN |
1997 |
DBLP DOI BibTeX RDF |
|
50 | Kun Wei, James Heather |
Embedding the Stable Failures Model of CSP in PVS. |
IFM |
2005 |
DBLP DOI BibTeX RDF |
CSP, deadlock, determinism, liveness, theorem prover |
50 | Xu Wang 0001, A. W. Roscoe 0001, Ranko Lazic 0001 |
Relating Data Independent Trace Checks in CSP with UNITY Reachability under a Normality Assumption. |
IFM |
2004 |
DBLP DOI BibTeX RDF |
Trace refinement, Model checking, CSP, Array, Reachability, Data independence |
50 | Gerald H. Hilderink, Andry W. P. Bakkers, Jan F. Broenink |
A Distributed Real-Time Java System Based on CSP. |
ISORC |
2000 |
DBLP DOI BibTeX RDF |
scheduling, Java, real-time, formal method, object-oriented, distributed, embedded, CSP, priority |
50 | Colin J. Fidge |
A Formal Definition of Priority in CSP. |
ACM Trans. Program. Lang. Syst. |
1993 |
DBLP DOI BibTeX RDF |
Ada, Ada, CSP, Priority, Communicating Sequential Processes, occam, OCCAM, real-time programming |
49 | Robert Colvin, Ian J. Hayes |
CSP with Hierarchical State. |
IFM |
2009 |
DBLP DOI BibTeX RDF |
|
49 | Samira Sadaoui, Malek Mouhoub, Xiao Feng Li |
An OCL-Based CSP Specification and Solving Tool. |
New Challenges in Applied Intelligence Technologies |
2008 |
DBLP DOI BibTeX RDF |
|
49 | Edward Turner, Helen Treharne, Steve A. Schneider, Neil Evans |
Automatic Generation of CSP || B Skeletons from xUML Models. |
ICTAC |
2008 |
DBLP DOI BibTeX RDF |
|
49 | Giorgio Gosti |
Resolving CSP with Naming Games. |
ICLP |
2008 |
DBLP DOI BibTeX RDF |
|
49 | Markus Zanker, Dietmar Jannach, Marius-Calin Silaghi, Gerhard Friedrich |
A Distributed Generative CSP Framework for Multi-site Product Configuration. |
CIA |
2008 |
DBLP DOI BibTeX RDF |
|
49 | Ana Cavalcanti 0001, Marie-Claude Gaudel |
Testing for Refinement in CSP. |
ICFEM |
2007 |
DBLP DOI BibTeX RDF |
|
49 | Denis Gracanin, H. Lally Singh, Michael G. Hinchey, Mohamed Eltoweissy, Shawn A. Bohner |
A CSP-Based Agent Modeling Framework for the Cougaar Agent-Based Architecture. |
ECBS |
2005 |
DBLP DOI BibTeX RDF |
|
49 | Igor Razgon |
Complexity Analysis of Heuristic CSP Search Algorithms. |
CSCLP |
2005 |
DBLP DOI BibTeX RDF |
|
49 | Carla P. Gomes, David B. Shmoys |
Approximations and Randomization to Boost CSP Techniques. |
Ann. Oper. Res. |
2004 |
DBLP DOI BibTeX RDF |
|
49 | María Isabel Alfonso, Federico Barber |
A Mixed Closure-CSP Method for Solving Scheduling Problems. |
Appl. Intell. |
2004 |
DBLP DOI BibTeX RDF |
heuristic search, temporal reasoning, planning and scheduling |
49 | Christie Bolton, Jim Davies |
Refinement in Object-Z and CSP. |
IFM |
2002 |
DBLP DOI BibTeX RDF |
|
49 | Yat Chiu Law, Jimmy Ho-Man Lee |
Algebraic Properties of CSP Model Operators. |
CP |
2002 |
DBLP DOI BibTeX RDF |
|
49 | Miguel A. Salido, Federico Barber |
An Incremental and Non-binary CSP Solver: The Hyperpolyhedron Search Algorithm. |
CP |
2001 |
DBLP DOI BibTeX RDF |
|
49 | Nico Roos, Yongping Ran, H. Jaap van den Herik |
Combining Local Search and Constraint Propagation to Find a Minimal Change Solution for a Dynamic CSP. |
AIMSA |
2000 |
DBLP DOI BibTeX RDF |
|
49 | Heike Wehrheim |
Data Abstraction for CSP-OZ. |
World Congress on Formal Methods |
1999 |
DBLP DOI BibTeX RDF |
|
49 | Zineb Habbas, Francine Herrmann, Daniel Singer, Michaël Krajecki |
A Methodological Approach to Implement CSP on FPGA. |
IEEE International Workshop on Rapid System Prototyping |
1999 |
DBLP DOI BibTeX RDF |
|
49 | Alexandre Mota 0001, Augusto Sampaio |
Model-Checking CSP-Z. |
FASE |
1998 |
DBLP DOI BibTeX RDF |
|
49 | Stefan S. Dantchev, Frank D. Valencia |
On the computational limits of infinite satisfaction. |
SAC |
2005 |
DBLP DOI BibTeX RDF |
infinite CSP, open CSP, decidability, constraint satisfaction problems |
49 | David A. Basin, Ernst-Rüdiger Olderog, Paul E. Sevinç |
Specifying and analyzing security automata using CSP-OZ. |
AsiaCCS |
2007 |
DBLP DOI BibTeX RDF |
CSP-OZ, security automata |
49 | Adnan Sherif, Augusto Sampaio, Sérgio Cavalcante |
Specification and Validation of the SACI-1 On-Board Computer Using Timed-CSP-Z and Petri Nets. |
ICATPN |
2003 |
DBLP DOI BibTeX RDF |
Real-time Systems, Case Studies, Z, Time CSP |
49 | Krishna M. Kavi, Frederick T. Sheldon, Behrooz A. Shirazi, Ali R. Hurson |
Reliability analysis of CSP specifications using Petri nets and Markov processes. |
HICSS (2) |
1995 |
DBLP DOI BibTeX RDF |
stochastic analyses, CSP-based system specifications, potential failure processes, recovery actions, user level specification, performance, formal specification, Petri nets, Petri nets, Markov processes, Markov processes, cost, functionality, system recovery, safety-critical software, failure analysis, reliability analysis, communicating sequential processes, user needs |
49 | Albert John Camilleri |
Mechanizing CSP Trace Theory in Higher Order Logic. |
IEEE Trans. Software Eng. |
1990 |
DBLP DOI BibTeX RDF |
mechanising CSP trace theory, general-purpose theorem prover, formal specification, theorem proving, formal logic, higher order logic, communicating sequential processes |
48 | Sadie Creese |
Industrial Strength CSP: Opportunities and Challenges in Model-Checking. |
25 Years Communicating Sequential Processes |
2004 |
DBLP DOI BibTeX RDF |
|
48 | Mike Reed |
Order, Topology, and Recursion Induction in CSP. |
25 Years Communicating Sequential Processes |
2004 |
DBLP DOI BibTeX RDF |
|
48 | Stephen D. Brookes |
Retracing the Semantics of CSP. |
25 Years Communicating Sequential Processes |
2004 |
DBLP DOI BibTeX RDF |
|
48 | Jan Peleska 0001 |
Applied Formal Methods - From CSP to Executable Hybrid Specifications. |
25 Years Communicating Sequential Processes |
2004 |
DBLP DOI BibTeX RDF |
|
44 | Augusto Sampaio, Jim Woodcock 0001, Ana Cavalcanti 0001 |
Refinement in Circus. |
FME |
2002 |
DBLP DOI BibTeX RDF |
unifying theories of programming, distribution, CSP, Z |
44 | Jianxin Wang 0001, Min Huang, Jianer Chen |
A Lower Bound on Approximation Algorithms for the Closest Substring Problem. |
COCOA |
2007 |
DBLP DOI BibTeX RDF |
|
44 | Steve A. Schneider, Helen Treharne |
Verifying Controlled Components. |
IFM |
2004 |
DBLP DOI BibTeX RDF |
|
44 | Yong Gao 0001, Joseph C. Culberson |
Consistency and Random Constraint Satisfaction Models with a High Constraint Tightness. |
CP |
2004 |
DBLP DOI BibTeX RDF |
|
44 | Andrei A. Bulatov |
A Dichotomy Theorem for Constraints on a Three-Element Set. |
FOCS |
2002 |
DBLP DOI BibTeX RDF |
|
44 | Lefteris M. Kirousis |
Fast Parallel Constraint Satisfaction. |
ICALP |
1993 |
DBLP DOI BibTeX RDF |
|
44 | Bernard A. Nadel |
Representation Selection for Constraint Satisfaction: A Case Study Using n-Queens. |
IEEE Expert |
1990 |
DBLP DOI BibTeX RDF |
|
44 | Andrew Cheese |
Multi-Moded Relations in Parlog. |
ACM SIGPLAN Notices |
1987 |
DBLP DOI BibTeX RDF |
PARLOG, PARLOG |
43 | Montserrat Abril, Miguel A. Salido, Federico Barber |
DFS-Tree Based Heuristic Search. |
SARA |
2007 |
DBLP DOI BibTeX RDF |
CSP Decomposition, DFS-tree, heuristic search, Constraint Satisfaction Problems |
42 | Neil Evans, Helen Treharne, Régine Laleau, Marc Frappier |
Applying CSP || B to information systems. |
Softw. Syst. Model. |
2008 |
DBLP DOI BibTeX RDF |
Information systems, CSP, Compositional verification, B, Combining formalisms |
42 | Yan Tang, Jingtian Tang, Andong Gong |
Multi-Class EEG Classification for Brain Computer Interface based on CSP. |
BMEI (2) |
2008 |
DBLP DOI BibTeX RDF |
Multi-Class EEG Classification, CSP, BCI |
42 | Michael Leuschel, Marisa Llorens, Javier Oliver 0001, Josep Silva, Salvador Tamarit |
The MEB and CEB Static Analysis for CSP Specifications. |
LOPSTR |
2008 |
DBLP DOI BibTeX RDF |
CSP, Concurrent Programming, Program Slicing |
42 | Christie Marr |
Capturing Conflict and Confusion in CSP. |
IFM |
2007 |
DBLP DOI BibTeX RDF |
Interleaving Concurrency, Petri Nets, CSP, Conflict, Automatic Verification, True Concurrency, Confusion |
42 | A. W. Roscoe 0001 |
On the expressive power of CSP refinement. |
Formal Aspects Comput. |
2005 |
DBLP DOI BibTeX RDF |
Refinement, Topology, CSP, Full abstraction |
42 | Jeremy W. Bryans |
Reasoning about XACML policies using CSP. |
SWS |
2005 |
DBLP DOI BibTeX RDF |
santic models, access control, CSP, XACML |
42 | Wing Lok Yeung, Steve A. Schneider |
Design and Verification of Distributed Recovery Blocks with CSP. |
Formal Methods Syst. Des. |
2003 |
DBLP DOI BibTeX RDF |
distributed recovery block scheme, timewise refinement, fault-tolerance, real-time systems, CSP, formal specification and verification |
42 | Peter H. Welch, Jeremy M. R. Martin |
A CSP Model for Java Multithreading. |
PDSE |
2000 |
DBLP DOI BibTeX RDF |
race hazard, JCSP, security, Java, model checking, verification, monitors, CSP, deadlock, threads, FDR, livelock |
42 | Neil Evans, Steve A. Schneider |
Analysing Time Dependent Security Properties in CSP Using PVS. |
ESORICS |
2000 |
DBLP DOI BibTeX RDF |
Authentication Protocol Verification, Timed Behaviour, CSP, Automated Theorem Proving, PVS |
42 | Christopher H. Nevison |
Seminar: safe concurrent programming in Java with CSP. |
SIGCSE |
1999 |
DBLP DOI BibTeX RDF |
Java, CSP, concurrent programming, threads |
42 | Steve A. Schneider |
Verifying Authentication Protocols in CSP. |
IEEE Trans. Software Eng. |
1998 |
DBLP DOI BibTeX RDF |
Needham-Schroeder protocol, verification, Authentication, formal methods, security protocols, CSP |
42 | Gavin Lowe, A. W. Roscoe 0001 |
Using CSP to Detect Errors in the TMN Protocol. |
IEEE Trans. Software Eng. |
1997 |
DBLP DOI BibTeX RDF |
protocol failure, model checking, cryptography, Security protocols, CSP, key establishment, FDR |
42 | Steve A. Schneider |
Verifying authentication protocols with CSP. |
CSFW |
1997 |
DBLP DOI BibTeX RDF |
Needham-Schroeder protocol, verification, Authentication, formal methods, security protocols, CSP |
42 | Andrew M. Tyrrell, Geof F. Carpenter |
CSP Methods for Identifying Atomic Actions in the Design of Fault Tolerant Concurrent Systems. |
IEEE Trans. Software Eng. |
1995 |
DBLP DOI BibTeX RDF |
fault tolerance, CSP, concurrent systems, Atomic actions |
Displaying result #1 - #100 of 2636 (100 per page; Change: ) Pages: [ 1][ 2][ 3][ 4][ 5][ 6][ 7][ 8][ 9][ 10][ >>] |
|