CBMC
partial_order_concurrencyt Class Referenceabstract

Base class for implementing memory models via additional constraints for SSA equations. More...

#include <partial_order_concurrency.h>

+ Inheritance diagram for partial_order_concurrencyt:
+ Collaboration diagram for partial_order_concurrencyt:

Classes

struct  a_rect
 

Public Types

enum  axiomt { AX_SC_PER_LOCATION =1 , AX_NO_THINAIR =2 , AX_OBSERVATION =4 , AX_PROPAGATION =8 }
 
typedef SSA_stept eventt
 
typedef symex_target_equationt::SSA_stepst eventst
 
typedef eventst::const_iterator event_it
 

Public Member Functions

 partial_order_concurrencyt (const namespacet &_ns)
 
virtual ~partial_order_concurrencyt ()
 

Static Public Member Functions

static irep_idt rw_clock_id (event_it e, axiomt axiom=AX_PROPAGATION)
 Build identifier for the read/write clock variable. More...
 

Protected Types

typedef std::vector< event_itevent_listt
 
typedef std::map< irep_idt, a_rectaddress_mapt
 
typedef std::map< event_it, unsigned > numberingt
 

Protected Member Functions

void build_event_lists (symex_target_equationt &equation, message_handlert &message_handler)
 First call add_init_writes then for each shared read/write (or spawn) populate: 1) the address_map (with a list of reads/writes for the address of each event) 2) the numbering map (with per-thread unique number of every event) More...
 
void add_init_writes (symex_target_equationt &)
 For each shared read event and for each shared write event that appears after spawn or has false guard prepend a shared write SSA step with non-deterministic value. More...
 
irep_idt address (event_it event) const
 Produce an address ID for an event. More...
 
symbol_exprt clock (event_it e, axiomt axiom)
 Produce a clock symbol for some event. More...
 
void build_clock_type ()
 Initialize the clock_type so that it can be used to number events. More...
 
void add_constraint (symex_target_equationt &equation, const exprt &cond, const std::string &msg, const symex_targett::sourcet &source) const
 Simplify and add a constraint to equation. More...
 
exprt before (event_it e1, event_it e2, unsigned axioms)
 Build the partial order constraint for two events: if e1 and e2 are in the same atomic section then constrain with equality between their clocks otherwise constrain with e1 clock being less than e2 clock. More...
 
virtual exprt before (event_it e1, event_it e2)=0
 

Static Protected Member Functions

static irep_idt id (event_it event)
 Produce the symbol ID for an event. More...
 

Protected Attributes

const namespacetns
 
address_mapt address_map
 
numberingt numbering
 
typet clock_type
 

Detailed Description

Base class for implementing memory models via additional constraints for SSA equations.

Provides methods for encoding ordering of shared read/write events.

Definition at line 20 of file partial_order_concurrency.h.

Member Typedef Documentation

◆ address_mapt

Definition at line 58 of file partial_order_concurrency.h.

◆ event_it

typedef eventst::const_iterator partial_order_concurrencyt::event_it

Definition at line 28 of file partial_order_concurrency.h.

◆ event_listt

typedef std::vector<event_it> partial_order_concurrencyt::event_listt
protected

Definition at line 50 of file partial_order_concurrency.h.

◆ eventst

◆ eventt

◆ numberingt

typedef std::map<event_it, unsigned> partial_order_concurrencyt::numberingt
protected

Definition at line 80 of file partial_order_concurrency.h.

Member Enumeration Documentation

◆ axiomt

Enumerator
AX_SC_PER_LOCATION 
AX_NO_THINAIR 
AX_OBSERVATION 
AX_PROPAGATION 

Definition at line 31 of file partial_order_concurrency.h.

Constructor & Destructor Documentation

◆ partial_order_concurrencyt()

partial_order_concurrencyt::partial_order_concurrencyt ( const namespacet _ns)
explicit

Definition at line 18 of file partial_order_concurrency.cpp.

◆ ~partial_order_concurrencyt()

partial_order_concurrencyt::~partial_order_concurrencyt ( )
virtual

Definition at line 23 of file partial_order_concurrency.cpp.

Member Function Documentation

◆ add_constraint()

void partial_order_concurrencyt::add_constraint ( symex_target_equationt equation,
const exprt cond,
const std::string &  msg,
const symex_targett::sourcet source 
) const
protected

Simplify and add a constraint to equation.

Parameters
equationtarget equation to be constrained with the cond
condcondition expressing the constraint
msgmessage for the constraint
sourcethe location of the constraint

Definition at line 202 of file partial_order_concurrency.cpp.

◆ add_init_writes()

void partial_order_concurrencyt::add_init_writes ( symex_target_equationt equation)
protected

For each shared read event and for each shared write event that appears after spawn or has false guard prepend a shared write SSA step with non-deterministic value.

Parameters
equationthe target equation to be modified

Definition at line 27 of file partial_order_concurrency.cpp.

◆ address()

irep_idt partial_order_concurrencyt::address ( event_it  event) const
inlineprotected

Produce an address ID for an event.

Parameters
eventSSA step for the event
Returns
L1-renamed identifier

Definition at line 94 of file partial_order_concurrency.h.

◆ before() [1/2]

virtual exprt partial_order_concurrencyt::before ( event_it  e1,
event_it  e2 
)
protectedpure virtual

Implemented in memory_model_tsot, and memory_model_sct.

◆ before() [2/2]

exprt partial_order_concurrencyt::before ( event_it  e1,
event_it  e2,
unsigned  axioms 
)
protected

Build the partial order constraint for two events: if e1 and e2 are in the same atomic section then constrain with equality between their clocks otherwise constrain with e1 clock being less than e2 clock.

Parameters
e1preceding event
e2succeeding event
axiomsclocks to be included in the resulting constraint
Returns
conjunction of constraints (one of each clock)

Definition at line 168 of file partial_order_concurrency.cpp.

◆ build_clock_type()

void partial_order_concurrencyt::build_clock_type ( )
protected

Initialize the clock_type so that it can be used to number events.

Definition at line 160 of file partial_order_concurrency.cpp.

◆ build_event_lists()

void partial_order_concurrencyt::build_event_lists ( symex_target_equationt equation,
message_handlert message_handler 
)
protected

First call add_init_writes then for each shared read/write (or spawn) populate: 1) the address_map (with a list of reads/writes for the address of each event) 2) the numbering map (with per-thread unique number of every event)

Parameters
equationthe target equation (containing the events to be processed)
message_handlermessage handler to output statistics

Definition at line 74 of file partial_order_concurrency.cpp.

◆ clock()

symbol_exprt partial_order_concurrencyt::clock ( event_it  e,
axiomt  axiom 
)
protected

Produce a clock symbol for some event.

Parameters
eevent is either shared read/write or spawn
axiomclock variable
Returns
symbol of type clock_type with id from rw_clock_id

Definition at line 137 of file partial_order_concurrency.cpp.

◆ id()

static irep_idt partial_order_concurrencyt::id ( event_it  event)
inlinestaticprotected

Produce the symbol ID for an event.

Parameters
eventSSA step for the event
Returns
identifier

Definition at line 86 of file partial_order_concurrency.h.

◆ rw_clock_id()

irep_idt partial_order_concurrencyt::rw_clock_id ( event_it  e,
axiomt  axiom = AX_PROPAGATION 
)
static

Build identifier for the read/write clock variable.

Parameters
eeither shared read or shared write event
axiomthe clock variable to be used (as part of the identifier)
Returns
identifier representing the clock variable of the event

Definition at line 125 of file partial_order_concurrency.cpp.

Member Data Documentation

◆ address_map

address_mapt partial_order_concurrencyt::address_map
protected

Definition at line 59 of file partial_order_concurrency.h.

◆ clock_type

typet partial_order_concurrencyt::clock_type
protected

Definition at line 99 of file partial_order_concurrency.h.

◆ ns

const namespacet& partial_order_concurrencyt::ns
protected

Definition at line 48 of file partial_order_concurrency.h.

◆ numbering

numberingt partial_order_concurrencyt::numbering
protected

Definition at line 81 of file partial_order_concurrency.h.


The documentation for this class was generated from the following files: