yusuke1997/dblp-id-title huggingface dataset:
Emptiness Check of Powerset Buchi Automata using Inclusion Tests
Fault-Free Refinements for Interface Automata
Software Implementation of Synchronous Programs
An Automated Fine-Grain Pipelining Using Domino Style Asynchronous Library
Improving the Significance of Benchmarks for Petri Nets Model Checkers
Checking pi-Calculus Structural Congruence is Graph Isomorphism Complete
Strength and Weaknesses of Genetic List Scheduling for Heterogeneous Systems
BenchKit, a Tool for Massive Concurrent Benchmarking
Concurrency in Distributed Systems under Autonomous and Enforced Actions
State Space Analysis Using Symmetries on Decision Diagrams
Discrete real-time and stochastic-time process algebra for performance analysis of distributed systems
A Heuristic Algorithm for Deriving Compact Models of Processor Instruction Sets
Mapping Applications to Tiled Multiprocessor Embedded Systems
VoDkaV Tool: Model Checking for Extracting Global Scheduler Properties from Local Restrictions
19th International Conference on Application of Concurrency to System Design, ACSD 2019, Aachen, Germany, June 23-28, 2019
14th International Conference on Application of Concurrency to System Design, ACSD 2014, Tunis La Marsa, Tunisia, June 23-27, 2014
New Automatic Agent-Based Solutions for Feasible Reconfigurable MP-SoC Architectures
Modular construction of the symbolic observation graph
Xprova: Formal Verification Tool with Built-in Metastability Modeling
Taming the Shrew - Resolving Structural Heterogeneities with Hierarchical CPNs
CONFRES: Interactive Coding Conflict Resolver Based on Core Visualisation
Verifying Reference Nets By Means of Hypernets: a Plugin for Renew
Process Windows
Testing Preorders for dMTS: Deadlock- and the New Deadlock/Divergence-Testing
Timing Analysis of Binary Programs with UPPAAL
IRS-MT: Tool for Intelligent Resource Allocation
Seventh International Conference on Application of Concurrency to System Design (ACSD 2007), 10-13 July 2007, Bratislava, Slovak Republic
Modifying Petri Net Models by Means of Crosscutting Operations
2nd International Conference on Application of Concurrency to System Design (ACSD 2001), 25-30 June 2001, Newcastle upon Tyne, UK
Cost-Based Fitness in Conformance Checking
When Do We (Not) Need Complex Assume-Guarantee Rules?
A Parametric Tool for Applied Process Calculi
A Framework for Composition, Verification and Real-Time Performance of Multimedia Interactive Scenarios
Lock-free Concurrent Data Structures and How to Model their Performance
Building a Symbolic Model Checker from Formal Language Description
Modelling Mobility with UML2.0 and PEPA Nets
BoPi - A Distributed Machine for Experimenting Web Services Technologies
A Presentation of Regular Languages in the Assumption - Commitment Framework
Specification and Verification of Dynamic Communication Systems
A more efficient time Petri net state space abstraction preserving linear properties
Property-Preserving Generation of Tailored Benchmark Petri Nets
Robustness of Sequential Circuits
1st International Conference on Application of Concurrency to System Design (ACSD '98), 23-26 March 1998, Fukushima, Japan
Complexity Results for Checking Distributed Implementability
Verifying Fault Tolerance of Distributed Algorithms Formally - An Example
A Behavioral Type Inference System for Compositional System-on-Chip Design
A New Synchronization in Finite Stochastic Petri Box Calculus
Exploration Testing
Identifying State Coding Conflicts in Asynchronous System Specifications Using Petri Net Unfoldings
Output-Determinacy and Asynchronous Circuit Synthesis
Sarir: A Rebeca to mCRL2 Translator
Incremental Inductive Verification of Parameterized Timed Systems
Process Refinement and Asynchronous Composition with Modalities
Improving a Workflow Management System with an Agent Flavour
From POOSL to UPPAAL: Transformation and Quantitative Analysis
GSPNs Revisited: Simple Semantics and New Analysis Algorithms
New features in CPN-AMI 3: focusing on the analysis of complex distributed systems
An Approach to Verification of MPI Applications Defined in a High-Level Model
Run-Time Concurrency Tuning for Peak Power Modulation in Energy Harvesting Systems
Component-Based Design: Towards Guided Composition
Maximal Causality Analysis
Strategies for Optimised STG Decomposition
Modelling Gradients using Petri Nets
The Reality of System Design Today: Do Theory and Practice Meet?
Implementing Communicating Processes in the Event of Interface Difference
Structural Conditions for Model-checking of Parameterized Networks
Improving Dynamic Partial Order Reductions for Concolic Testing
Killer-mobiles: The way towards energy efficient high performance computers?
Cyclo-Static Data Flow Model for TDM
The BDD Space Complexity of Different Forms of Concurrency
CAST - A Task-Level Concurrency Analysis Tool
Polychrony for Formal Refinement-Checking in a System-Level Design Methodology
Time-bounded model checking of infinite-state continuous-time Markov chains
Modelling Latency-Insensitive Systems in CSP
Partial-Order Reduction for Performance Analysis of Max-Plus Timed Systems
A model-driven design approach for mechatronic systems
How to Make Concurrent Programs Highly Reliable- More than State Space Analysis
Utilizing Petri Nets for Teaching in Practical Courses on Collaborative Software Engineering
Compositional Analysis for Weak Stubborn Sets
Static Mapping of Real-Time Applications onto Massively Parallel Processor Arrays
Towards Optimal Supervisory Control of Discrete-Time Stochastic Discrete-Event Processes with Data
Ninth International Conference on Application of Concurrency to System Design, ACSD 2009, Augsburg, Germany, 1-3 July 2009
DESIJ--Enabling Decomposition-Based Synthesis of Complex Asynchronous Controllers
Translating Erlang to µCRL
Checking Non-divergence, Channel-Bound and Global Cooperation Using SAT-Solvers
Memory Model-Aware Testing - A Unified Complexity Analysis
The Design of Virtual Self-timed Block for Activity Communication in SOC
Desynchronizing Synchronous Programs by Modes
Control of DES with Urgency, Avoidability and Ineluctability
Models of Computation for Networks on Chip
Algorithms for Signal and Message Asynchronous Communication Mechanisms and Their Analysis
Asynchronous Data Path Models
Detecting State Coding Conflicts in STG Unfoldings Using SAT
Incremental Generation of Linear Invariants for Component-Based Systems
Verification of Parameterized Asynchronous Circuits: A Case Study
On Cyclic Behaviour of Unbounded Petri Nets
A design method for 1-out-of-4 encoded low-power self-timed circuits using standard cell libraries
Studying the Interplay of Concurrency, Performance, Energy and Reliability with ArchOn - An Architecture-Open Resource-Driven Cross-Layer Modelling Framework
Why Are Modalities Good for Interface Theories?
Sixth International Conference on Application of Concurrency to System Design (ACSD 2006), 28-30 June 2006, Turku, Finland
Modularity and Part-Whole Compositionality for Computing the State Semantics of Statecharts
Extended Rebeca: A Component-Based Actor Language with Synchronous Message Passing
Formal Verification of Real-Time Software by Symbolic Model-Checker
A New Multi-threaded Code Synthesis Methodology and Tool for Correct-by-Construction Synthesis from Polychronous Specifications
A High-Level Strategy for C-net Discovery
Dynamic semantics of OWL-S in CSP-OZ
An Algebraic Approach to Multi-Valued Model Checking
Developing a Formal Specification for the Mission System of a Maritime Surveillance Aircraft
A Linear Process-Algebraic Format for Probabilistic Systems with Data
Design Validation of ZCSP with SPIN
SAT-based Unbounded Model Checking of Timed Automata
8th International Conference on Application of Concurrency to System Design (ACSD 2008), Xi'an, China, June 23-27, 2008
Algebra of Parameterised Graphs
Two-Phase Distributed Observation Problems
STG-Based Resynthesis for Balsa Circuits
Proceedings of the Workshops of the 31st International Conference on Application and Theory of Petri Nets and Other Models of Concurrency (PETRI NETS 2010) and of the 10th International Conference on Application of Concurrency to System Design (ACSD 2010), Braga, Portugal, June, 2010
Liveness in L/U-Parametric Timed Automata
Verification and Implementation of Delay-Insensitive Processes in Restrictive Environments
Traffic Lights - An AutoFocus Case Study
17th International Conference on Application of Concurrency to System Design, ACSD 2017, Zaragoza, Spain, June 25-30, 2017
Towards Supervisory Control of Interactive Markov Chains: Controllability
Sensor Minimization Problems with Static or Dynamic Observers for Fault Diagnosis
Incremental Process Mining
Formal Design and Verification of an Asynchronous SRAM Controller
Enhanced Interleaved Multithreaded Multiprocessors and Their Performance Analysis
Controlling Actions and Time in Parametric Timed Automata
Model Driven Embedded Systems
Petri Net Modeling via a Modular and Hierarchical Approach Applied to Nociception
Detecting and Repairing Unintentional Change on In-use Data in Concurrent Workflow Management System
Concurrent Secrets with Quantified Suspicion
Power-Normalized Performance Optimization of Concurrent Many-Core Applications
Failure Semantics for Modal Transition Systems
Context-based Process Algebras for Mobility
Exploring the Potential of Instruction-Level Parallelism of Exposed Datapath Architectures with Buffered Processing Units
Reactive and Proactive Diagnosis of Distributed Systems Using Net Unfoldings
Generating Benchmarks by Random Stepwise Refinement of Petri Nets
Abstracting from Failure Probabilities
An effective approach for model checking SystemC designs
Verification of conditional partial order graphs
Avoiding irreducible CSC conflicts by internal communication
Unbounded Verification Results by Finite-State Compositional Techniques: 10 any States and Beyond
Logic of Involved Variables - System Specification with Temporal Logic of Distributed Actions
Petrifying Operating Guidelines for Services
Communicating with Synchronized Environments
Colored Petri nets to Model and Simulate Biological Systems
Modelling Data Processing for Interactive Scores Using Coloured Petri Nets
Integrating the Verification of Timing, Performance and Correctness Properties of Concurrent Systems
Synthesis of Net Systems with Inhibitor Arcs from Step Transition Systems
Rialto Profile in the SMW Toolkit
ABTOOLS: Another B Tool
Compositional High Level Petri Nets with Timing Constraints - A Comparison
BMC via Dynamic Atomicity Analysis
Monitoring and fault-diagnosis with digital clocks
Data-Flow Analysis of Extended Finite State Machines
Structural Computation of Alignments of Business Processes Over Partial Orders
On Lifting of Statechart Structuring Mechanisms
Resource-Constrained Optimal Scheduling of Synchronous Dataflow Graphs via Timed Automata
International Program Committee
Complexity of Reachability for Data-Aware Dynamic Systems
Hazard Checking of Timed Asynchronous Circuits Revisited
Sensor and Ad HocWireless Networks
15th International Conference on Application of Concurrency to System Design, ACSD 2015, Brussels, Belgium, June 21-26, 2015
Timed Automata with Parametric Updates
On Monitoring Concurrent Systems with TLA: An Example
A Method for Analysing the Performance of Certain Testing Techniques for Concurrent Systems
Biologically-Inspired Massively-Parallel Architectures - Computing Beyond a Million Processors
Nested Emptiness Search for Generalized Büchi Automata
3rd International Conference on Application of Concurrency to System Design (ACSD 2003), 18-20 June 2003, Guimaraes, Portugal
A Polynomial-Time Algorithm for Checking Consistency of Free-Choice Signal Transition Graphs
Modelling a Secure, Mobile, and Transactional System with CO-OPN
Diagnosability under Weak Fairness
Large-Scale On-Chip Dynamic Programming Network Inferences Using Moderated Inter-core Communication
Dynamic Critical-Path based on Fit Degree scheduling for reconfigurable multi-FPGAs
Using Object-Oriented Algebraic Nets for the Reverse Engineering of Java Programs: A Case Study
SDF 3 : SDF For Free
Concurrency in Synchronous Systems
Efficient Method for Checking the Existence of a Safety/ Reachability Controller for Time Petri Nets
Modular Interpretation of Heterogeneous Modeling Diagrams into Synchronous Equations Using Static Single Assignment
Design of Networks-on-Chip for Real-Time Multi-processor Systems-on-Chip
Modeling the SpaceWire Architecture with Lyra
System-Level Design Models and Implementation Techniques
Symbolic model checking of hierarchical UML state machines
Testing Times: On Model-Driven Test Generation for Non-Deterministic Real-Time Systems
Much Compact Time Petri Net State Class Spaces Useful to Restore CTL* Properties
Property Checking based on Hierarchical Integer Equations
Task-FIFO Co-scheduling of Streaming Applications on MPSoCs with Predictable Memory Hierarchy
Synthesis of Petri Nets from Finite Partial Languages
Timed Games for Computing WCET for Pipelined Processors with Caches
Weaving True-Concurrent Aspects Using Constraint Solvers
Aggregation Ordering for Massively Compositional Models
Control of Metabolic Systems Modeled with Timed Continuous Petri Nets
Genet: A Tool for the Synthesis and Mining of Petri Nets
Platform-scalable Task Partition and Multilevel Buffering in Multi-processor Plessey Corner Detector
Property Preserving Transition Refinement with Concurrent Runs: An Example
Overcoming Heterophobia: Modeling Concurrency in Heterogeneous Systems
Synthesis of Synchronous Interfaces
Factored Planning: From Automata to Petri Nets
A method for latency/bandwidth guarantees in Network-on-Chip
Bounds: From Parameterised to Finite-State Verification
Automata and Petri Net Models for Visualizing and Analyzing Complex Questionnaires: A Case Study
Testing the executability of scenarios in general inhibitor nets
Modeling and verifying asynchronous communication mechanisms using coloured Petri nets
Finding Structure in Unstructured Processes: The Case for Process Mining
Buffered Asynchronous Communication Mechanisms
A Robust Asynchronous Interfacing Scheme with Four-Phase Dual-Rail Coding
Separation of Concerns in the Formal Design of Real-Time Shared Data-Space Systems
STG Decomposition: Partitioning Heuristics
Asynchronous Packet-Switching for Networks-on-Chip
SyNAPSE: Jun Sawada
Removing causality cycle of synchronous programs with sequential data-flow recursion
A Formal Semantics of Exposed Datapath Architectures with Buffered Processing Units
Formal Methods for Networks on Chips
PicNIc - Pi-calculus non-interference checker
Selective Abstraction for Estimating Extra-Functional Properties in Networks-on-Chips Using ArchOn Framework
12th International Conference on Application of Concurrency to System Design, ACSD 2012, Hamburg, Germany, June 27-29, 2012
Toward a Correct-and-Scalable Verification of Concurrent Robotic Systems: Insights on Formalisms and Tools
Teak: A Token-Flow Implementation for the Balsa Language
STG Decomposition: Internal Communication for SI Implementability
Safety-Liveness Semantics for UML 2.0 Sequence Diagrams
Variants of the Language Based Synthesis Problem for Petri Nets
New Orbit Algorithms for Data Symmetries
Using CTL formulae as component abstraction in a design and verification flow
ACTL for Modal Interface Automata
Identification of Multiple Invalid Pairing-Based Signatures in Constrained Batches
A New Construction of Designated Confirmer Signature and Its Application to Optimistic Fair Exchange - (Extended Abstract)
Pairing-Based Cryptography - Pairing 2010 - 4th International Conference, Yamanaka Hot Spring, Japan, December 2010. Proceedings
Certificateless Public Key Encryption in the Selective-ID Security Model (Without Random Oracles)
On Efficient Pairings on Elliptic Curves over Extension Fields
Hyperelliptic Pairings
High Speed Flexible Pairing Cryptoprocessor on FPGA Platform
A Generalized Brezing-Weng Algorithm for Constructing Pairing-Friendly Ordinary Abelian Varieties
Ephemeral Key Leakage Resilient and Efficient ID-AKEs That Can Share Identities, Private and Master Keys
The Tate-Lichtenbaum Pairing on a Hyperelliptic Curve via Hyperelliptic Nets
Chosen-Ciphertext Secure Identity-Based Encryption from Computational Bilinear Diffie-Hellman
Implementing Pairings at the 192-Bit Security Level
The Importance of the Final Exponentiation in Pairings When Considering Fault Attacks
Zeta Function and Cryptographic Exponent of Supersingular Curves of Genus 2
Faster Implementation of eta-T Pairing over GF(3 m ) Using Minimum Number of Logical Instructions for GF(3)-Addition
Increased Resilience in Threshold Cryptography: Sharing a Secret with Devices That Cannot Store Shares
Algorithms for Pairing-Friendly Primes
Multisignatures as Secure as the Diffie-Hellman Problem in the Plain Public-Key Model
Shorter IBE and Signatures via Asymmetric Pairings
General and Efficient Certificateless Public Key Encryption Constructions
Stronger Security Model for Public-Key Encryption with Equality Test
On the Implementation of a Pairing-Based Cryptographic Protocol in a Constrained Device
On the Final Exponentiation for Calculating Pairings on Ordinary Elliptic Curves
PandA: Pairings and Arithmetic
Optimal Authenticated Data Structures with Multilinear Forms
Oblivious Transfer with Access Control : Realizing Disjunction without Duplication
Fair Blind Signatures Revisited
Remarks on Cheon's Algorithms for Pairing-Related Problems
Pairing-Based Cryptography - Pairing 2013 - 6th International Conference, Beijing, China, November 22-24, 2013, Revised Selected Papers
Adaptable Ciphertext-Policy Attribute-Based Encryption
Compact E-Cash and Simulatable VRFs Revisited
Generating Pairing-Friendly Curves with the CM Equation of Degree 1
Bilinear Groups of Composite Order
Fully Collusion Secure Dynamic Broadcast Encryption with Constant-Size Ciphertexts or Decryption Keys
Constructing Certificateless Encryption and ID-Based Encryption from ID-Based Key Agreement
Exponentiation in Pairing-Friendly Groups Using Homomorphisms
On the Minimal Embedding Field
Practical Time Capsule Signatures in the Standard Model from Bilinear Maps
Controlled Joining on Encrypted Relational Database
Pseudo 8-Sparse Multiplication for Efficient Ate-Based Pairing on Barreto-Naehrig Curve
Constructing Symmetric Pairings over Supersingular Elliptic Curves with Embedding Degree Three
Integer Variable chi-Based Ate Pairing
Compact Hardware for Computing the Tate Pairing over 128-Bit-Security Supersingular Curves
Faster Pairings on Special Weierstrass Curves
Some Security Topics with Possible Applications for Pairing-Based Cryptography
Improved Broadcast Encryption Scheme with Constant-Size Ciphertext
Factor-4 and 6 (De)Compression for Values of Pairings Using Trace Maps
Implementing Cryptographic Pairings over Barreto-Naehrig Curves
Efficient Semi-static Secure Broadcast Encryption Scheme
Security of Verifiably Encrypted Signatures and a Construction without Random Oracles
Tracing Malicious Proxies in Proxy Re-encryption
A Comparison between Hardware Accelerators for the Modified Tate Pairing over F 2 m and F 3 m
An Analysis of Affine Coordinates for Pairing Computation
Identity-Based Encryption: How to Decrypt Multiple Ciphertexts Using a Single Decryption Key
The Special Number Field Sieve in 𝔽 p n - Application to Pairing-Friendly Constructions
Proofs on Encrypted Values in Bilinear Groups and an Application to Anonymity of Signatures
Pairing-Based Non-interactive Zero-Knowledge Proofs
Anonymizable Signature and Its Construction from Pairings
Homomorphic Encryption and Signatures from Vector Decomposition
Provably Secure Pairing-Based Convertible Undeniable Signature with Short Signature Length
Evaluating Large Degree Isogenies and Applications to Pairing Based Cryptography
Conjunctive Broadcast and Attribute-Based Encryption
Fast Hashing to G 2 on Pairing-Friendly Curves
One-Round ID-Based Blind Signature Scheme without ROS Assumption
Faster Pairing Coprocessor Architecture
Group Signatures with Message-Dependent Opening
A New Method for Constructing Pairing-Friendly Abelian Surfaces
Hidden-Vector Encryption with Groups of Prime Order
Deterministic Encoding and Hashing to Odd Hyperelliptic Curves
Instruction Set Extensions for Pairing-Based Cryptography
Tate Pairing Computation on Jacobi's Elliptic Curves
Constructing Pairing-Friendly Genus 2 Curves with Ordinary Jacobians
An Improved Twisted Ate Pairing over KSS Curves with k = 18
On the Security of Pairing-Friendly Abelian Varieties over Non-prime Fields
Pairing-Based Cryptography - Pairing 2007, First International Conference, Tokyo, Japan, July 2-4, 2007, Proceedings
Encoding Points on Hyperelliptic Curves over Finite Fields in Deterministic Polynomial Time
Eta Pairing Computation on General Divisors over Hyperelliptic Curves y 2 = x 7 -x+/-1
Public Key Encryption with Conjunctive Keyword Search and Its Extension to a Multi-user System
Pairings in Trusted Computing
Revocable IBE Systems with Almost Constant-Size Key Update
Strongly Secure Two-Pass Attribute-Based Authenticated Key Exchange
Pairing-Based Cryptography - Pairing 2009, Third International Conference, Palo Alto, CA, USA, August 12-14, 2009, Proceedings
Predicate- and Attribute-Hiding Inner Product Encryption in a Public Key Setting
Speeding Up Pairing Computations on Genus 2 Hyperelliptic Curves with Efficiently Computable Automorphisms
Pairing Computation on Twisted Edwards Form Elliptic Curves
Designing a Code Generator for Pairing Based Cryptographic Functions
Proxy Re-encryption Systems for Identity-Based Encryption
Computing the Cassels Pairing on Kolyvagin Classes in the Shafarevich-Tate Group
The Hidden Root Problem
Constructing Pairing-Friendly Elliptic Curves Using Factorization of Cyclotomic Polynomials
A Survey of Local and Global Pairings on Elliptic Curves and Abelian Varieties
Pairing-Based Cryptography - Pairing 2008, Second International Conference, Egham, UK, September 1-3, 2008. Proceedings
High-Speed Software Implementation of the Optimal Ate Pairing over Barreto-Naehrig Curves
Strongly Secure Certificateless Key Agreement
Efficient Traceable Signatures in the Standard Model
Affine Pairings on ARM
Efficient Generic Constructions of Timed-Release Encryption with Pre-open Capability
The Uber-Assumption Family
Core Based Architecture to Speed Up Optimal Ate Pairing on FPGA Platform
Genus 2 Hyperelliptic Curve Families with Explicit Jacobian Order Evaluation and Pairing-Friendly Constructions
Shorter Verifier-Local Revocation Group Signature with Backward Unlinkability
EAGL: An Elliptic Curve Arithmetic GPU-Based Library for Bilinear Pairing
Constructing Brezing-Weng Pairing-Friendly Elliptic Curves Using Elements in the Cyclotomic Field
Generating More Kawazoe-Takahashi Genus 2 Pairing-Friendly Hyperelliptic Curves
Fully Secure Hidden Vector Encryption
Security and Anonymity of Identity-Based Encryption with Multiple Trusted Authorities
Weakness of 𝔽 3 6·509 for Discrete Logarithm Cryptography
Fast Symmetric Pairing Revisited
Supersingular Elliptic Curves in Cryptography
Fully Secure Anonymous HIBE and Secret-Key Anonymous IBE with Short Ciphertexts
Pairing-Friendly Hyperelliptic Curves with Ordinary Jacobians of Type y 2 =x 5 ax
Forward-Secure Group Signatures from Pairings
Identity Based Group Signatures from Hierarchical Identity-Based Encryption
Pairing Lattices
Divisible E-Cash in the Standard Model
New Identity-Based Proxy Re-encryption Schemes to Prevent Collusion Attacks
The Tate Pairing Via Elliptic Nets
Short Pairing-Efficient Threshold-Attribute-Based Signature
On Pairing Inversion Problems
Universally Composable Adaptive Priced Oblivious Transfer
A Variant of Miller's Formula and Algorithm
Pairing Inversion via Non-degenerate Auxiliary Pairings
Boneh-Boyen Signatures and the Strong Diffie-Hellman Problem
Pairing Computation on Elliptic Curves with Efficiently Computable Endomorphism and Small Embedding Degree
Pairings on Hyperelliptic Curves with a Real Model
Forward-Secure Hierarchical Predicate Encryption
Efficient Leakage-Resilient Identity-Based Encryption with CCA Security
Pairing-Based Cryptography - Pairing 2012 - 5th International Conference, Cologne, Germany, May 16-18, 2012, Revised Selected Papers
Generators for the l-Torsion Subgroup of Jacobians of Genus Two Curves